Base | Representation |
---|---|
bin | 1011000110111001110000… |
… | …1111011101001110111001 |
3 | 1121020120102211112222221120 |
4 | 2301232130033131032321 |
5 | 3100100130102220441 |
6 | 41550401151255453 |
7 | 2400242545226502 |
oct | 261563417351671 |
9 | 47216384488846 |
10 | 12213213320121 |
11 | 398965a580a80 |
12 | 145300451a589 |
13 | 6a791634c878 |
14 | 3031a08b7ba9 |
15 | 162a613d2966 |
hex | b1b9c3dd3b9 |
12213213320121 has 32 divisors (see below), whose sum is σ = 19134532538880. Its totient is φ = 6849292867200.
The previous prime is 12213213320117. The next prime is 12213213320141. The reversal of 12213213320121 is 12102331231221.
It is not a de Polignac number, because 12213213320121 - 22 = 12213213320117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12213213320091 and 12213213320100.
It is not an unprimeable number, because it can be changed into a prime (12213213320141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226470820 + ... + 226524741.
It is an arithmetic number, because the mean of its divisors is an integer number (597954141840).
Almost surely, 212213213320121 is an apocalyptic number.
12213213320121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12213213320121 is a deficient number, since it is larger than the sum of its proper divisors (6921319218759).
12213213320121 is a wasteful number, since it uses less digits than its factorization.
12213213320121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452995637.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 12213213320121 its reverse (12102331231221), we get a palindrome (24315544551342).
The spelling of 12213213320121 in words is "twelve trillion, two hundred thirteen billion, two hundred thirteen million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •