Base | Representation |
---|---|
bin | 1011000110001000100101… |
… | …0001100011100010000110 |
3 | 1121012022100200120001201220 |
4 | 2301202021101203202012 |
5 | 3044341110102414342 |
6 | 41540335102501210 |
7 | 2366264424454464 |
oct | 261421121434206 |
9 | 47168320501656 |
10 | 12200010201222 |
11 | 3983aa4783368 |
12 | 145053a894806 |
13 | 6a65c0b7108c |
14 | 3026ab197834 |
15 | 16253c20c5ec |
hex | b1889463886 |
12200010201222 has 32 divisors (see below), whose sum is σ = 24739833219072. Its totient is φ = 4010059669824.
The previous prime is 12200010201217. The next prime is 12200010201227. The reversal of 12200010201222 is 22210201000221.
It is an interprime number because it is at equal distance from previous prime (12200010201217) and next prime (12200010201227).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200010201227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1183978 + ... + 5079549.
It is an arithmetic number, because the mean of its divisors is an integer number (773119788096).
Almost surely, 212200010201222 is an apocalyptic number.
12200010201222 is an abundant number, since it is smaller than the sum of its proper divisors (12539823017850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12200010201222 is a wasteful number, since it uses less digits than its factorization.
12200010201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6268052.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12200010201222 its reverse (22210201000221), we get a palindrome (34410211201443).
The spelling of 12200010201222 in words is "twelve trillion, two hundred billion, ten million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •