Base | Representation |
---|---|
bin | 11101001010101001110… |
… | …10100000010111000011 |
3 | 10112210201200210111122021 |
4 | 32211110322200113003 |
5 | 112404401403044021 |
6 | 2044214323222311 |
7 | 132255155322205 |
oct | 16452472402703 |
9 | 3483650714567 |
10 | 1002152003011 |
11 | 357012752685 |
12 | 142282817997 |
13 | 7366c0936c3 |
14 | 3670c18c775 |
15 | 1b105651c41 |
hex | e954ea05c3 |
1002152003011 has 2 divisors, whose sum is σ = 1002152003012. Its totient is φ = 1002152003010.
The previous prime is 1002152002987. The next prime is 1002152003033. The reversal of 1002152003011 is 1103002512001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1002152003011 - 211 = 1002152000963 is a prime.
It is a super-2 number, since 2×10021520030112 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1002152013011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501076001505 + 501076001506.
It is an arithmetic number, because the mean of its divisors is an integer number (501076001506).
Almost surely, 21002152003011 is an apocalyptic number.
1002152003011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002152003011 is an equidigital number, since it uses as much as digits as its factorization.
1002152003011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 1002152003011 its reverse (1103002512001), we get a palindrome (2105154515012).
The spelling of 1002152003011 in words is "one trillion, two billion, one hundred fifty-two million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •