Base | Representation |
---|---|
bin | 10110110000101011010001… |
… | …011001110101100111110001 |
3 | 111010102122210221211220201222 |
4 | 112300223101121311213301 |
5 | 101110032414334340303 |
6 | 552522122243034425 |
7 | 30041063253345002 |
oct | 2660532131654761 |
9 | 433378727756658 |
10 | 100102021011953 |
11 | 29994035230494 |
12 | b28853836ba15 |
13 | 43b177057893c |
14 | 1aa0d6c43b1a9 |
15 | b88d3b16c938 |
hex | 5b0ad16759f1 |
100102021011953 has 2 divisors, whose sum is σ = 100102021011954. Its totient is φ = 100102021011952.
The previous prime is 100102021011931. The next prime is 100102021012073. The reversal of 100102021011953 is 359110120201001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96068559322849 + 4033461689104 = 9801457^2 + 2008348^2 .
It is a cyclic number.
It is not a de Polignac number, because 100102021011953 - 244 = 82509834967537 is a prime.
It is a super-2 number, since 2×1001020210119532 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100102021011353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051010505976 + 50051010505977.
It is an arithmetic number, because the mean of its divisors is an integer number (50051010505977).
Almost surely, 2100102021011953 is an apocalyptic number.
It is an amenable number.
100102021011953 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102021011953 is an equidigital number, since it uses as much as digits as its factorization.
100102021011953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 26.
Adding to 100102021011953 its reverse (359110120201001), we get a palindrome (459212141212954).
The spelling of 100102021011953 in words is "one hundred trillion, one hundred two billion, twenty-one million, eleven thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •