Base | Representation |
---|---|
bin | 1001101001010110100111… |
… | …10011111000100011011011 |
3 | 2210002212010212102001111222 |
4 | 10310223103303320203123 |
5 | 10240014341114214321 |
6 | 113040412152442255 |
7 | 4316344443624560 |
oct | 464532363704333 |
9 | 83085125361458 |
10 | 21212102101211 |
11 | 683900270196a |
12 | 246706a0a938b |
13 | bab3a5c31278 |
14 | 534957b80867 |
15 | 26bb9725e3ab |
hex | 134ad3cf88db |
21212102101211 has 16 divisors (see below), whose sum is σ = 24252680415744. Its totient is φ = 18174094835904.
The previous prime is 21212102100979. The next prime is 21212102101231. The reversal of 21212102101211 is 11210120121212.
It is not a de Polignac number, because 21212102101211 - 214 = 21212102084827 is a prime.
It is a super-3 number, since 3×212121021012113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21212102101211.
It is not an unprimeable number, because it can be changed into a prime (21212102101231) 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, 179480840 + ... + 179598986.
It is an arithmetic number, because the mean of its divisors is an integer number (1515792525984).
Almost surely, 221212102101211 is an apocalyptic number.
21212102101211 is a deficient number, since it is larger than the sum of its proper divisors (3040578314533).
21212102101211 is a wasteful number, since it uses less digits than its factorization.
21212102101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128810.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21212102101211 its reverse (11210120121212), we get a palindrome (32422222222423).
The spelling of 21212102101211 in words is "twenty-one trillion, two hundred twelve billion, one hundred two million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •