Base | Representation |
---|---|
bin | 1001001101000100101110… |
… | …1010010001000001000011 |
3 | 1022211111000222220212001111 |
4 | 2103101023222101001003 |
5 | 2311302143323222243 |
6 | 33305054504144151 |
7 | 2063106203246350 |
oct | 223211352210103 |
9 | 38744028825044 |
10 | 10120212320323 |
11 | 3251a5a026586 |
12 | 1175446768057 |
13 | 585441321901 |
14 | 26db6c743627 |
15 | 1283b388839d |
hex | 9344ba91043 |
10120212320323 has 16 divisors (see below), whose sum is σ = 11576338124544. Its totient is φ = 8666685228960.
The previous prime is 10120212320321. The next prime is 10120212320359. The reversal of 10120212320323 is 32302321202101.
It is a cyclic number.
It is not a de Polignac number, because 10120212320323 - 21 = 10120212320321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10120212320294 and 10120212320303.
It is not an unprimeable number, because it can be changed into a prime (10120212320321) 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 15 ways as a sum of consecutive naturals, for example, 35995713 + ... + 36275773.
It is an arithmetic number, because the mean of its divisors is an integer number (723521132784).
Almost surely, 210120212320323 is an apocalyptic number.
10120212320323 is a deficient number, since it is larger than the sum of its proper divisors (1456125804221).
10120212320323 is a wasteful number, since it uses less digits than its factorization.
10120212320323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284682.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10120212320323 its reverse (32302321202101), we get a palindrome (42422533522424).
The spelling of 10120212320323 in words is "ten trillion, one hundred twenty billion, two hundred twelve million, three hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •