Base | Representation |
---|---|
bin | 10110111110000011001000… |
… | …111100000110011101010011 |
3 | 111020200111212022201002220102 |
4 | 112332003020330012131103 |
5 | 101220112003003001321 |
6 | 554504224015003015 |
7 | 30164345414016506 |
oct | 2676031074063523 |
9 | 436614768632812 |
10 | 101021002000211 |
11 | 2a208848020737 |
12 | b3b666920946b |
13 | 444a316576b37 |
14 | 1ad362a64d13d |
15 | ba2bc4c2ac0b |
hex | 5be0c8f06753 |
101021002000211 has 4 divisors (see below), whose sum is σ = 101024049516000. Its totient is φ = 101017954484424.
The previous prime is 101021002000157. The next prime is 101021002000213. The reversal of 101021002000211 is 112000200120101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101021002000211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101021002000192 and 101021002000201.
It is not an unprimeable number, because it can be changed into a prime (101021002000213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1523708171 + ... + 1523774468.
It is an arithmetic number, because the mean of its divisors is an integer number (25256012379000).
Almost surely, 2101021002000211 is an apocalyptic number.
101021002000211 is a deficient number, since it is larger than the sum of its proper divisors (3047515789).
101021002000211 is an equidigital number, since it uses as much as digits as its factorization.
101021002000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3047515788.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101021002000211 its reverse (112000200120101), we get a palindrome (213021202120312).
The spelling of 101021002000211 in words is "one hundred one trillion, twenty-one billion, two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •