Base | Representation |
---|---|
bin | 100000001100100101001… |
… | …101010110111001100101 |
3 | 21211111221012002020101210 |
4 | 200030211031112321211 |
5 | 242222231244303401 |
6 | 4412231240142033 |
7 | 315564421143240 |
oct | 40144515267145 |
9 | 7744835066353 |
10 | 2212532416101 |
11 | 783369960767 |
12 | 2b8978767919 |
13 | 13084410ca77 |
14 | 79131182257 |
15 | 3c8467e04d6 |
hex | 20325356e65 |
2212532416101 has 48 divisors (see below), whose sum is σ = 3581849262080. Its totient is φ = 1189806140160.
The previous prime is 2212532416069. The next prime is 2212532416117. The reversal of 2212532416101 is 1016142352122.
It is not a de Polignac number, because 2212532416101 - 25 = 2212532416069 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2212532416121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 94415856 + ... + 94439286.
Almost surely, 22212532416101 is an apocalyptic number.
2212532416101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2212532416101 is a deficient number, since it is larger than the sum of its proper divisors (1369316845979).
2212532416101 is a wasteful number, since it uses less digits than its factorization.
2212532416101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39034 (or 39017 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 2212532416101 its reverse (1016142352122), we get a palindrome (3228674768223).
The spelling of 2212532416101 in words is "two trillion, two hundred twelve billion, five hundred thirty-two million, four hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •