Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …101010110110011101011011 |
3 | 111010102200022010111120200212 |
4 | 112300223130222312131123 |
5 | 101110033311231134321 |
6 | 552522153114121335 |
7 | 30041101040035256 |
oct | 2660533452663533 |
9 | 433380263446625 |
10 | 100102210021211 |
11 | 29994121996992 |
12 | b28858b72024b |
13 | 43b17a0785438 |
14 | 1aa0d8959c09d |
15 | b88d4ca5555b |
hex | 5b0adcab675b |
100102210021211 has 4 divisors (see below), whose sum is σ = 103554010366800. Its totient is φ = 96650409675624.
The previous prime is 100102210021199. The next prime is 100102210021249. The reversal of 100102210021211 is 112120012201001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100102210021211 - 214 = 100102210004827 is a prime.
It is a super-2 number, since 2×1001022100212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100102210026211) 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, 1725900172751 + ... + 1725900172808.
It is an arithmetic number, because the mean of its divisors is an integer number (25888502591700).
Almost surely, 2100102210021211 is an apocalyptic number.
100102210021211 is a deficient number, since it is larger than the sum of its proper divisors (3451800345589).
100102210021211 is an equidigital number, since it uses as much as digits as its factorization.
100102210021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3451800345588.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100102210021211 its reverse (112120012201001), we get a palindrome (212222222222212).
The spelling of 100102210021211 in words is "one hundred trillion, one hundred two billion, two hundred ten million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •