Base | Representation |
---|---|
bin | 1011000110110101100111… |
… | …1101001000011010110111 |
3 | 1121020110120022221110102001 |
4 | 2301231121331020122313 |
5 | 3100040340403020043 |
6 | 41550054543200131 |
7 | 2400203152436245 |
oct | 261553175103267 |
9 | 47213508843361 |
10 | 12212101220023 |
11 | 3989139851791 |
12 | 1452953ba6047 |
13 | 6a7799b23483 |
14 | 3030d6d09795 |
15 | 1629e895b74d |
hex | b1b59f486b7 |
12212101220023 has 4 divisors (see below), whose sum is σ = 12606039969088. Its totient is φ = 11818162470960.
The previous prime is 12212101219999. The next prime is 12212101220027. The reversal of 12212101220023 is 32002210121221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12212101220023 - 29 = 12212101219511 is a prime.
It is a super-2 number, since 2×122121012200232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12212101220027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196969374486 + ... + 196969374547.
It is an arithmetic number, because the mean of its divisors is an integer number (3151509992272).
Almost surely, 212212101220023 is an apocalyptic number.
12212101220023 is a deficient number, since it is larger than the sum of its proper divisors (393938749065).
12212101220023 is an equidigital number, since it uses as much as digits as its factorization.
12212101220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393938749064.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 12212101220023 its reverse (32002210121221), we get a palindrome (44214311341244).
The spelling of 12212101220023 in words is "twelve trillion, two hundred twelve billion, one hundred one million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •