Base | Representation |
---|---|
bin | 101111101001000111… |
… | …0010101001100101100 |
3 | 100210002020121111001220 |
4 | 1133102032111030230 |
5 | 3134013133020022 |
6 | 115000124303340 |
7 | 10251240010161 |
oct | 1372216251454 |
9 | 323066544056 |
10 | 102311220012 |
11 | 3a43201a991 |
12 | 179b39a1b50 |
13 | 98565b2851 |
14 | 4d47db0068 |
15 | 29dc0c585c |
hex | 17d239532c |
102311220012 has 48 divisors (see below), whose sum is σ = 240222931200. Its totient is φ = 33890034112.
The previous prime is 102311219963. The next prime is 102311220017. The reversal of 102311220012 is 210022113201.
It is a junction number, because it is equal to n+sod(n) for n = 102311219973 and 102311220000.
It is not an unprimeable number, because it can be changed into a prime (102311220017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13918114 + ... + 13925462.
It is an arithmetic number, because the mean of its divisors is an integer number (5004644400).
Almost surely, 2102311220012 is an apocalyptic number.
102311220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102311220012 is an abundant number, since it is smaller than the sum of its proper divisors (137911711188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102311220012 is a wasteful number, since it uses less digits than its factorization.
102311220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14470 (or 14468 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102311220012 its reverse (210022113201), we get a palindrome (312333333213).
The spelling of 102311220012 in words is "one hundred two billion, three hundred eleven million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •