Base | Representation |
---|---|
bin | 1001011000110101101001… |
… | …0101100000110010000111 |
3 | 1100112210201100221102102102 |
4 | 2112031122111200302013 |
5 | 2323110103413013111 |
6 | 33542002000102315 |
7 | 2113522522220105 |
oct | 226153225406207 |
9 | 40483640842372 |
10 | 10322322001031 |
11 | 331a743738057 |
12 | 11a865090499b |
13 | 59b51073b061 |
14 | 279862ab0c75 |
15 | 12d79213813b |
hex | 9635a560c87 |
10322322001031 has 32 divisors (see below), whose sum is σ = 10698311779200. Its totient is φ = 9955432396800.
The previous prime is 10322322001009. The next prime is 10322322001049. The reversal of 10322322001031 is 13010022322301.
It is a cyclic number.
It is not a de Polignac number, because 10322322001031 - 242 = 5924275489927 is a prime.
It is a super-2 number, since 2×103223220010312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10322322000994 and 10322322001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10322322001051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 603036485 + ... + 603053601.
It is an arithmetic number, because the mean of its divisors is an integer number (334322243100).
Almost surely, 210322322001031 is an apocalyptic number.
10322322001031 is a deficient number, since it is larger than the sum of its proper divisors (375989778169).
10322322001031 is a wasteful number, since it uses less digits than its factorization.
10322322001031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18299.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10322322001031 its reverse (13010022322301), we get a palindrome (23332344323332).
The spelling of 10322322001031 in words is "ten trillion, three hundred twenty-two billion, three hundred twenty-two million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •