Base | Representation |
---|---|
bin | 11101001010101001000… |
… | …01110110011110100001 |
3 | 10112210201020122011001112 |
4 | 32211110201312132201 |
5 | 112404343224240001 |
6 | 2044213532513105 |
7 | 132255046353464 |
oct | 16452441663641 |
9 | 3483636564045 |
10 | 1002145540001 |
11 | 35700a038951 |
12 | 14228061b795 |
13 | 7366a93ca38 |
14 | 3670b3892db |
15 | 1b104cc6cbb |
hex | e9548767a1 |
1002145540001 has 2 divisors, whose sum is σ = 1002145540002. Its totient is φ = 1002145540000.
The previous prime is 1002145539971. The next prime is 1002145540003. The reversal of 1002145540001 is 1000455412001.
1002145540001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 725810283025 + 276335256976 = 851945^2 + 525676^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002145540001 - 222 = 1002141345697 is a prime.
It is a Sophie Germain prime.
Together with 1002145540003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1002145540003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501072770000 + 501072770001.
It is an arithmetic number, because the mean of its divisors is an integer number (501072770001).
Almost surely, 21002145540001 is an apocalyptic number.
It is an amenable number.
1002145540001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002145540001 is an equidigital number, since it uses as much as digits as its factorization.
1002145540001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 800, while the sum is 23.
The spelling of 1002145540001 in words is "one trillion, two billion, one hundred forty-five million, five hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •