Base | Representation |
---|---|
bin | 10110101111111010… |
… | …11100101101100100 |
3 | 1011112011012000112020 |
4 | 23113331130231210 |
5 | 200003031110140 |
6 | 5335522023140 |
7 | 611440005021 |
oct | 132775345544 |
9 | 34464160466 |
10 | 12213144420 |
11 | 51a8002194 |
12 | 244a1a7ab0 |
13 | 11c8371999 |
14 | 83c062548 |
15 | 4b73246d0 |
hex | 2d7f5cb64 |
12213144420 has 96 divisors (see below), whose sum is σ = 36252147456. Its totient is φ = 3061555200.
The previous prime is 12213144409. The next prime is 12213144421. The reversal of 12213144420 is 2444131221.
It is not an unprimeable number, because it can be changed into a prime (12213144421) 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, 891825 + ... + 905415.
It is an arithmetic number, because the mean of its divisors is an integer number (377626536).
Almost surely, 212213144420 is an apocalyptic number.
12213144420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12213144420, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18126073728).
12213144420 is an abundant number, since it is smaller than the sum of its proper divisors (24039003036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12213144420 is a wasteful number, since it uses less digits than its factorization.
12213144420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14501 (or 14499 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 12213144420 its reverse (2444131221), we get a palindrome (14657275641).
The spelling of 12213144420 in words is "twelve billion, two hundred thirteen million, one hundred forty-four thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •