Base | Representation |
---|---|
bin | 111100010100111… |
… | …110000011100111 |
3 | 2121112111112101011 |
4 | 330110332003213 |
5 | 4033101130043 |
6 | 244233243051 |
7 | 34036651252 |
oct | 7424760347 |
9 | 2545445334 |
10 | 1012130023 |
11 | 47a3592a3 |
12 | 242b63487 |
13 | 1318c6408 |
14 | 985c8099 |
15 | 5dcca59d |
hex | 3c53e0e7 |
1012130023 has 8 divisors (see below), whose sum is σ = 1017017408. Its totient is φ = 1007252064.
The previous prime is 1012130011. The next prime is 1012130033. The reversal of 1012130023 is 3200312101.
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 1012130023 - 221 = 1010032871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012129985 and 1012130012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012130033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 301090 + ... + 304432.
It is an arithmetic number, because the mean of its divisors is an integer number (127127176).
Almost surely, 21012130023 is an apocalyptic number.
1012130023 is a deficient number, since it is larger than the sum of its proper divisors (4887385).
1012130023 is a wasteful number, since it uses less digits than its factorization.
1012130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4713.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1012130023 is about 31813.9909945294. The cubic root of 1012130023 is about 1004.0271016821.
Adding to 1012130023 its reverse (3200312101), we get a palindrome (4212442124).
The spelling of 1012130023 in words is "one billion, twelve million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •