Base | Representation |
---|---|
bin | 10110101111011111110100… |
… | …110001110100100100001001 |
3 | 111010010220201011120100211001 |
4 | 112233133310301310210021 |
5 | 101102221012042414032 |
6 | 552421003454335001 |
7 | 30032164605221224 |
oct | 2657376461644411 |
9 | 433126634510731 |
10 | 100021010123017 |
11 | 29962743743605 |
12 | b2748a9aba461 |
13 | 43a6c2cb935b9 |
14 | 1a9b08531c5bb |
15 | b86b9906b3e7 |
hex | 5af7f4c74909 |
100021010123017 has 2 divisors, whose sum is σ = 100021010123018. Its totient is φ = 100021010123016.
The previous prime is 100021010122993. The next prime is 100021010123033. The reversal of 100021010123017 is 710321010120001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98229189612096 + 1791820510921 = 9911064^2 + 1338589^2 .
It is a cyclic number.
It is not a de Polignac number, because 100021010123017 - 27 = 100021010122889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100021010122985 and 100021010123003.
It is not a weakly prime, because it can be changed into another prime (100021010123717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010505061508 + 50010505061509.
It is an arithmetic number, because the mean of its divisors is an integer number (50010505061509).
Almost surely, 2100021010123017 is an apocalyptic number.
It is an amenable number.
100021010123017 is a deficient number, since it is larger than the sum of its proper divisors (1).
100021010123017 is an equidigital number, since it uses as much as digits as its factorization.
100021010123017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 100021010123017 its reverse (710321010120001), we get a palindrome (810342020243018).
The spelling of 100021010123017 in words is "one hundred trillion, twenty-one billion, ten million, one hundred twenty-three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •