Base | Representation |
---|---|
bin | 1001011000110000101110… |
… | …0011100111111010111111 |
3 | 1100112200022020221001202122 |
4 | 2112030023203213322333 |
5 | 2323044402034101343 |
6 | 33541222503313155 |
7 | 2113445003025014 |
oct | 226141343477277 |
9 | 40480266831678 |
10 | 10321000300223 |
11 | 331a125668738 |
12 | 11a834214b7bb |
13 | 59b35c975782 |
14 | 27977934170b |
15 | 12d7160ad068 |
hex | 9630b8e7ebf |
10321000300223 has 12 divisors (see below), whose sum is σ = 11540874499560. Its totient is φ = 9202625649792.
The previous prime is 10321000300207. The next prime is 10321000300249. The reversal of 10321000300223 is 32200300012301.
It is not a de Polignac number, because 10321000300223 - 24 = 10321000300207 is a prime.
It is a super-2 number, since 2×103210003002232 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10321000300253) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 939805136 + ... + 939816117.
It is an arithmetic number, because the mean of its divisors is an integer number (961739541630).
Almost surely, 210321000300223 is an apocalyptic number.
10321000300223 is a deficient number, since it is larger than the sum of its proper divisors (1219874199337).
10321000300223 is a wasteful number, since it uses less digits than its factorization.
10321000300223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1879621306 (or 1879621289 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 10321000300223 its reverse (32200300012301), we get a palindrome (42521300312524).
The spelling of 10321000300223 in words is "ten trillion, three hundred twenty-one billion, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •