Base | Representation |
---|---|
bin | 1011000000111101000100… |
… | …0111000101001110111100 |
3 | 1120212210122212212102210120 |
4 | 2300033101013011032330 |
5 | 3041411332400231022 |
6 | 41431420513334540 |
7 | 2356664251552530 |
oct | 260172107051674 |
9 | 46783585772716 |
10 | 12111021102012 |
11 | 394a289750a78 |
12 | 1437244567450 |
13 | 69b0ab604861 |
14 | 2dc268643bc0 |
15 | 16007e9b6d5c |
hex | b03d11c53bc |
12111021102012 has 24 divisors (see below), whose sum is σ = 32296056272256. Its totient is φ = 3460291743408.
The previous prime is 12111021101923. The next prime is 12111021102127. The reversal of 12111021102012 is 21020112011121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12111021101982 and 12111021102000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72089411238 + ... + 72089411405.
It is an arithmetic number, because the mean of its divisors is an integer number (1345669011344).
Almost surely, 212111021102012 is an apocalyptic number.
12111021102012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12111021102012 is an abundant number, since it is smaller than the sum of its proper divisors (20185035170244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111021102012 is a wasteful number, since it uses less digits than its factorization.
12111021102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144178822657 (or 144178822655 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12111021102012 its reverse (21020112011121), we get a palindrome (33131133113133).
The spelling of 12111021102012 in words is "twelve trillion, one hundred eleven billion, twenty-one million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •