Base | Representation |
---|---|
bin | 111101000010010… |
… | …000000011100111 |
3 | 2122100211121020111 |
4 | 331002100003213 |
5 | 4044121001411 |
6 | 245335513451 |
7 | 34242600262 |
oct | 7502200347 |
9 | 2570747214 |
10 | 1024000231 |
11 | 486026591 |
12 | 246b28887 |
13 | 1341c12c7 |
14 | 99dd7cd9 |
15 | 5ed72721 |
hex | 3d0900e7 |
1024000231 has 8 divisors (see below), whose sum is σ = 1081998720. Its totient is φ = 966412152.
The previous prime is 1024000217. The next prime is 1024000247. The reversal of 1024000231 is 1320004201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1024000231 - 215 = 1023967463 is a prime.
It is a super-2 number, since 2×10240002312 = 2097152946176106722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1024000261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97465 + ... + 107458.
It is an arithmetic number, because the mean of its divisors is an integer number (135249840).
Almost surely, 21024000231 is an apocalyptic number.
1024000231 is a deficient number, since it is larger than the sum of its proper divisors (57998489).
1024000231 is a wasteful number, since it uses less digits than its factorization.
1024000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205205.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 1024000231 is about 32000.0036093748. The cubic root of 1024000231 is about 1007.9369157080.
Adding to 1024000231 its reverse (1320004201), we get a palindrome (2344004432).
The spelling of 1024000231 in words is "one billion, twenty-four million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •