Base | Representation |
---|---|
bin | 1001001000000000100110… |
… | …0000100000011110000001 |
3 | 1022112011110011202111210121 |
4 | 2102000021200200132001 |
5 | 2303340444444320001 |
6 | 33201105003100241 |
7 | 2053606061246365 |
oct | 222001140403601 |
9 | 38464404674717 |
10 | 10033203120001 |
11 | 321906a661566 |
12 | 1160603511681 |
13 | 57a1860122a9 |
14 | 269876b352a5 |
15 | 125ebed846a1 |
hex | 92009820781 |
10033203120001 has 2 divisors, whose sum is σ = 10033203120002. Its totient is φ = 10033203120000.
The previous prime is 10033203119999. The next prime is 10033203120011. The reversal of 10033203120001 is 10002130233001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6473849229376 + 3559353890625 = 2544376^2 + 1886625^2 .
It is an emirp because it is prime and its reverse (10002130233001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10033203120001 - 21 = 10033203119999 is a prime.
Together with 10033203119999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10033203120011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5016601560000 + 5016601560001.
It is an arithmetic number, because the mean of its divisors is an integer number (5016601560001).
Almost surely, 210033203120001 is an apocalyptic number.
It is an amenable number.
10033203120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10033203120001 is an equidigital number, since it uses as much as digits as its factorization.
10033203120001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10033203120001 its reverse (10002130233001), we get a palindrome (20035333353002).
The spelling of 10033203120001 in words is "ten trillion, thirty-three billion, two hundred three million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •