Base | Representation |
---|---|
bin | 11101011100111111111… |
… | …10001111111101101111 |
3 | 10120202011002211001221120 |
4 | 32232133332033331233 |
5 | 113040034302211343 |
6 | 2052523522032023 |
7 | 133054222233063 |
oct | 16563776177557 |
9 | 3522132731846 |
10 | 1012001210223 |
11 | 360207333853 |
12 | 1441711a8613 |
13 | 7457b765173 |
14 | 36da429baa3 |
15 | 1b4d0175683 |
hex | eb9ff8ff6f |
1012001210223 has 8 divisors (see below), whose sum is σ = 1350008611968. Its totient is φ = 674330640984.
The previous prime is 1012001210203. The next prime is 1012001210243. The reversal of 1012001210223 is 3220121002101.
It is an interprime number because it is at equal distance from previous prime (1012001210203) and next prime (1012001210243).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012001210223 - 26 = 1012001210159 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012001210203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84201115 + ... + 84213132.
It is an arithmetic number, because the mean of its divisors is an integer number (168751076496).
Almost surely, 21012001210223 is an apocalyptic number.
1012001210223 is a deficient number, since it is larger than the sum of its proper divisors (338007401745).
1012001210223 is a wasteful number, since it uses less digits than its factorization.
1012001210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168416253.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1012001210223 its reverse (3220121002101), we get a palindrome (4232122212324).
The spelling of 1012001210223 in words is "one trillion, twelve billion, one million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •