Base | Representation |
---|---|
bin | 100000001100010010001… |
… | …100000010001110111001 |
3 | 21211111002221121120102110 |
4 | 200030102030002032321 |
5 | 242221103101132301 |
6 | 4412135440322533 |
7 | 315553464545100 |
oct | 40142214021671 |
9 | 7744087546373 |
10 | 2212213302201 |
11 | 783215811771 |
12 | 2b88a9913449 |
13 | 1307c2c7bc86 |
14 | 79100a35037 |
15 | 3c8287a80d6 |
hex | 203123023b9 |
2212213302201 has 12 divisors (see below), whose sum is σ = 3431187979152. Its totient is φ = 1264121886888.
The previous prime is 2212213302107. The next prime is 2212213302223. The reversal of 2212213302201 is 1022033122122.
It is not a de Polignac number, because 2212213302201 - 27 = 2212213302073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (2212213302281) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7524534895 + ... + 7524535188.
It is an arithmetic number, because the mean of its divisors is an integer number (285932331596).
Almost surely, 22212213302201 is an apocalyptic number.
2212213302201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2212213302201 is a deficient number, since it is larger than the sum of its proper divisors (1218974676951).
2212213302201 is a wasteful number, since it uses less digits than its factorization.
2212213302201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15049070100 (or 15049070093 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2212213302201 its reverse (1022033122122), we get a palindrome (3234246424323).
The spelling of 2212213302201 in words is "two trillion, two hundred twelve billion, two hundred thirteen million, three hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •