Base | Representation |
---|---|
bin | 1010111011101110110111… |
… | …1111000011000111001111 |
3 | 1120120020002211220100210020 |
4 | 2232323231333003013033 |
5 | 3033424121133102343 |
6 | 41322303015313223 |
7 | 2350340204266512 |
oct | 256735577030717 |
9 | 46506084810706 |
10 | 12021311222223 |
11 | 3915233876556 |
12 | 142198897b813 |
13 | 6927b2931454 |
14 | 2d7b980a6d79 |
15 | 15ca7dd46b83 |
hex | aeeedfc31cf |
12021311222223 has 32 divisors (see below), whose sum is σ = 16461531601152. Its totient is φ = 7799027846400.
The previous prime is 12021311222203. The next prime is 12021311222231. The reversal of 12021311222223 is 32222211312021.
It is not a de Polignac number, because 12021311222223 - 26 = 12021311222159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12021311222193 and 12021311222202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021311222203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 420002853 + ... + 420031473.
It is an arithmetic number, because the mean of its divisors is an integer number (514422862536).
Almost surely, 212021311222223 is an apocalyptic number.
12021311222223 is a deficient number, since it is larger than the sum of its proper divisors (4440220378929).
12021311222223 is a wasteful number, since it uses less digits than its factorization.
12021311222223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40535.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 12021311222223 its reverse (32222211312021), we get a palindrome (44243522534244).
The spelling of 12021311222223 in words is "twelve trillion, twenty-one billion, three hundred eleven million, two hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •