Base | Representation |
---|---|
bin | 10111001100010100110110… |
… | …111111110110100101001001 |
3 | 111101011022020210121022020102 |
4 | 113030110312333312211021 |
5 | 101332200300330133001 |
6 | 1000535041315535145 |
7 | 30325260103056056 |
oct | 2714246677664511 |
9 | 441138223538212 |
10 | 102002101021001 |
11 | 2a556936923155 |
12 | b5348352ba4b5 |
13 | 44bb9aba64abc |
14 | 1b28cdc73602d |
15 | bbd496e66e6b |
hex | 5cc536ff6949 |
102002101021001 has 2 divisors, whose sum is σ = 102002101021002. Its totient is φ = 102002101021000.
The previous prime is 102002101020887. The next prime is 102002101021013. The reversal of 102002101021001 is 100120101200201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101930750597776 + 71350423225 = 10096076^2 + 267115^2 .
It is a cyclic number.
It is not a de Polignac number, because 102002101021001 - 222 = 102002096826697 is a prime.
It is a super-2 number, since 2×1020021010210012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102002101021021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001050510500 + 51001050510501.
It is an arithmetic number, because the mean of its divisors is an integer number (51001050510501).
Almost surely, 2102002101021001 is an apocalyptic number.
It is an amenable number.
102002101021001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102002101021001 is an equidigital number, since it uses as much as digits as its factorization.
102002101021001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102002101021001 its reverse (100120101200201), we get a palindrome (202122202221202).
The spelling of 102002101021001 in words is "one hundred two trillion, two billion, one hundred one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •