Base | Representation |
---|---|
bin | 11011100101101… |
… | …00101111000101 |
3 | 121010110201011212 |
4 | 31302310233011 |
5 | 433221131023 |
6 | 34544141205 |
7 | 5510045216 |
oct | 1562645705 |
9 | 533421155 |
10 | 231427013 |
11 | 1096a85a4 |
12 | 65607805 |
13 | 38c3b97c |
14 | 22a4340d |
15 | 154b5e78 |
hex | dcb4bc5 |
231427013 has 4 divisors (see below), whose sum is σ = 236351040. Its totient is φ = 226502988.
The previous prime is 231427003. The next prime is 231427019. The reversal of 231427013 is 310724132.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 231427013 - 216 = 231361477 is a prime.
It is a super-2 number, since 2×2314270132 = 107116924692204338, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 231427013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231427019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2461943 + ... + 2462036.
It is an arithmetic number, because the mean of its divisors is an integer number (59087760).
Almost surely, 2231427013 is an apocalyptic number.
It is an amenable number.
231427013 is a deficient number, since it is larger than the sum of its proper divisors (4924027).
231427013 is an equidigital number, since it uses as much as digits as its factorization.
231427013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4924026.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 231427013 is about 15212.7253639839. The cubic root of 231427013 is about 613.9570867312.
The spelling of 231427013 in words is "two hundred thirty-one million, four hundred twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •