Base | Representation |
---|---|
bin | 10110101111011110111001… |
… | …110101000010010100010001 |
3 | 111010010211011020120022001112 |
4 | 112233132321311002110101 |
5 | 101102212000401010113 |
6 | 552420321404343105 |
7 | 30032131235600363 |
oct | 2657367165022421 |
9 | 433124136508045 |
10 | 100020021110033 |
11 | 29962286444502 |
12 | b274672844a95 |
13 | 43a6b0300230b |
14 | 1a9adcdc30d33 |
15 | b86b3c30a5a8 |
hex | 5af7b9d42511 |
100020021110033 has 2 divisors, whose sum is σ = 100020021110034. Its totient is φ = 100020021110032.
The previous prime is 100020021109949. The next prime is 100020021110039. The reversal of 100020021110033 is 330011120020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99867383996689 + 152637113344 = 9993367^2 + 390688^2 .
It is a cyclic number.
It is not a de Polignac number, because 100020021110033 - 212 = 100020021105937 is a prime.
It is a super-2 number, since 2×1000200211100332 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100020021110039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010010555016 + 50010010555017.
It is an arithmetic number, because the mean of its divisors is an integer number (50010010555017).
Almost surely, 2100020021110033 is an apocalyptic number.
It is an amenable number.
100020021110033 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020021110033 is an equidigital number, since it uses as much as digits as its factorization.
100020021110033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100020021110033 its reverse (330011120020001), we get a palindrome (430031141130034).
The spelling of 100020021110033 in words is "one hundred trillion, twenty billion, twenty-one million, one hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •