Base | Representation |
---|---|
bin | 10110101111011111110100… |
… | …110001110100100100011001 |
3 | 111010010220201011120100211122 |
4 | 112233133310301310210121 |
5 | 101102221012042414113 |
6 | 552421003454335025 |
7 | 30032164605221246 |
oct | 2657376461644431 |
9 | 433126634510748 |
10 | 100021010123033 |
11 | 2996274374361a |
12 | b2748a9aba475 |
13 | 43a6c2cb935cc |
14 | 1a9b08531c5cd |
15 | b86b9906b408 |
hex | 5af7f4c74919 |
100021010123033 has 2 divisors, whose sum is σ = 100021010123034. Its totient is φ = 100021010123032.
The previous prime is 100021010123017. The next prime is 100021010123051. The reversal of 100021010123033 is 330321010120001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97409951643904 + 2611058479129 = 9869648^2 + 1615877^2 .
It is an emirp because it is prime and its reverse (330321010120001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100021010123033 - 24 = 100021010123017 is a prime.
It is not a weakly prime, because it can be changed into another prime (100021010123533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010505061516 + 50010505061517.
It is an arithmetic number, because the mean of its divisors is an integer number (50010505061517).
Almost surely, 2100021010123033 is an apocalyptic number.
It is an amenable number.
100021010123033 is a deficient number, since it is larger than the sum of its proper divisors (1).
100021010123033 is an equidigital number, since it uses as much as digits as its factorization.
100021010123033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100021010123033 its reverse (330321010120001), we get a palindrome (430342020243034).
The spelling of 100021010123033 in words is "one hundred trillion, twenty-one billion, ten million, one hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •