Base | Representation |
---|---|
bin | 1011000111010011100000… |
… | …0010000001101000110100 |
3 | 1121021020021022110220211102 |
4 | 2301310320002001220310 |
5 | 3100203302213342322 |
6 | 41553502504425232 |
7 | 2400606005155112 |
oct | 261647002015064 |
9 | 47236238426742 |
10 | 12220122012212 |
11 | 3991585330664 |
12 | 1454412178218 |
13 | 6a847776645a |
14 | 303658266ab2 |
15 | 162d17bb2792 |
hex | b1d38081a34 |
12220122012212 has 6 divisors (see below), whose sum is σ = 21385213521378. Its totient is φ = 6110061006104.
The previous prime is 12220122012191. The next prime is 12220122012223. The reversal of 12220122012212 is 21221022102221.
It can be written as a sum of positive squares in only one way, i.e., 12216171386896 + 3950625316 = 3495164^2 + 62854^2 .
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 1527515251523 + ... + 1527515251530.
It is an arithmetic number, because the mean of its divisors is an integer number (3564202253563).
Almost surely, 212220122012212 is an apocalyptic number.
It is an amenable number.
12220122012212 is a deficient number, since it is larger than the sum of its proper divisors (9165091509166).
12220122012212 is a wasteful number, since it uses less digits than its factorization.
12220122012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3055030503057 (or 3055030503055 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12220122012212 its reverse (21221022102221), we get a palindrome (33441144114433).
Subtracting 12220122012212 from its reverse (21221022102221), we obtain a palindrome (9000900090009).
The spelling of 12220122012212 in words is "twelve trillion, two hundred twenty billion, one hundred twenty-two million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •