Base | Representation |
---|---|
bin | 10110011000000100… |
… | …10110010010001100 |
3 | 1011000012202211012212 |
4 | 23030002112102030 |
5 | 144100323232340 |
6 | 5304014245552 |
7 | 603460453430 |
oct | 131402262214 |
9 | 34005684185 |
10 | 12013102220 |
11 | 51050a0559 |
12 | 23b31b68b8 |
13 | 1195aa1412 |
14 | 81d66c9c0 |
15 | 4a49aca65 |
hex | 2cc09648c |
12013102220 has 24 divisors (see below), whose sum is σ = 28831445664. Its totient is φ = 4118777856.
The previous prime is 12013102201. The next prime is 12013102247. The reversal of 12013102220 is 2220131021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 12013102195 and 12013102204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42903797 + ... + 42904076.
It is an arithmetic number, because the mean of its divisors is an integer number (1201310236).
Almost surely, 212013102220 is an apocalyptic number.
12013102220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12013102220 is an abundant number, since it is smaller than the sum of its proper divisors (16818343444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12013102220 is a wasteful number, since it uses less digits than its factorization.
12013102220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85807889 (or 85807887 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 12013102220 its reverse (2220131021), we get a palindrome (14233233241).
The spelling of 12013102220 in words is "twelve billion, thirteen million, one hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •