Base | Representation |
---|---|
bin | 1001000111011011011000… |
… | …0000100110010111001101 |
3 | 1022111012122220021212202010 |
4 | 2101312312000212113031 |
5 | 2303210014322441023 |
6 | 33152333345251433 |
7 | 2053103354630325 |
oct | 221666600462715 |
9 | 38435586255663 |
10 | 10023212312013 |
11 | 321490305565a |
12 | 115a695633b79 |
13 | 5792531c29a4 |
14 | 2691a9cc6285 |
15 | 125ad7be0093 |
hex | 91db60265cd |
10023212312013 has 8 divisors (see below), whose sum is σ = 13486891184800. Its totient is φ = 6620837490288.
The previous prime is 10023212311909. The next prime is 10023212312041. The reversal of 10023212312013 is 31021321232001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10023212312013 - 212 = 10023212307917 is a prime.
It is a super-2 number, since 2×100232123120132 (a number of 27 digits) 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 (10023212312053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15326012383 + ... + 15326013036.
It is an arithmetic number, because the mean of its divisors is an integer number (1685861398100).
Almost surely, 210023212312013 is an apocalyptic number.
It is an amenable number.
10023212312013 is a deficient number, since it is larger than the sum of its proper divisors (3463678872787).
10023212312013 is a wasteful number, since it uses less digits than its factorization.
10023212312013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30652025531.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10023212312013 its reverse (31021321232001), we get a palindrome (41044533544014).
The spelling of 10023212312013 in words is "ten trillion, twenty-three billion, two hundred twelve million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •