Base | Representation |
---|---|
bin | 1001000110010001001111… |
… | …1010110111110001101101 |
3 | 1022102022022002021201202102 |
4 | 2101210103322313301231 |
5 | 2302343241114013201 |
6 | 33135243014504445 |
7 | 2051500264555511 |
oct | 221442372676155 |
9 | 38368262251672 |
10 | 10003313032301 |
11 | 320742146a246 |
12 | 1156861365125 |
13 | 577401651674 |
14 | 26823d13c141 |
15 | 125320c1c26b |
hex | 91913eb7c6d |
10003313032301 has 4 divisors (see below), whose sum is σ = 10326000549504. Its totient is φ = 9680625515100.
The previous prime is 10003313032291. The next prime is 10003313032319. The reversal of 10003313032301 is 10323031330001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10003313032301 - 222 = 10003308837997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10003313032351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 161343758555 + ... + 161343758616.
It is an arithmetic number, because the mean of its divisors is an integer number (2581500137376).
Almost surely, 210003313032301 is an apocalyptic number.
It is an amenable number.
10003313032301 is a deficient number, since it is larger than the sum of its proper divisors (322687517203).
10003313032301 is an equidigital number, since it uses as much as digits as its factorization.
10003313032301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322687517202.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 10003313032301 its reverse (10323031330001), we get a palindrome (20326344362302).
The spelling of 10003313032301 in words is "ten trillion, three billion, three hundred thirteen million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •