Base | Representation |
---|---|
bin | 110000000001011000010001… |
… | …001011110000111001000101 |
3 | 1000200210121201112021022211111 |
4 | 300001120101023300321011 |
5 | 210140304132042010041 |
6 | 2025104223221205021 |
7 | 62325524626324261 |
oct | 6001302113607105 |
9 | 1020717645238744 |
10 | 211201010110021 |
11 | 61327933232028 |
12 | 1b830206b60771 |
13 | 90b022906bc29 |
14 | 3a2227d49b0a1 |
15 | 1963c526e9981 |
hex | c016112f0e45 |
211201010110021 has 16 divisors (see below), whose sum is σ = 215597576232000. Its totient is φ = 206819754156288.
The previous prime is 211201010110003. The next prime is 211201010110033. The reversal of 211201010110021 is 120011010102112.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211201010110021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211201010109983 and 211201010110010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211201010110091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 349010250 + ... + 349614868.
It is an arithmetic number, because the mean of its divisors is an integer number (13474848514500).
Almost surely, 2211201010110021 is an apocalyptic number.
It is an amenable number.
211201010110021 is a deficient number, since it is larger than the sum of its proper divisors (4396566121979).
211201010110021 is a wasteful number, since it uses less digits than its factorization.
211201010110021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 617268.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211201010110021 its reverse (120011010102112), we get a palindrome (331212020212133).
The spelling of 211201010110021 in words is "two hundred eleven trillion, two hundred one billion, ten million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •