Base | Representation |
---|---|
bin | 1010111011001001001111… |
… | …1101110011010000110000 |
3 | 1120112021000221120110212112 |
4 | 2232302103331303100300 |
5 | 3033242430004323440 |
6 | 41313512452544452 |
7 | 2346532002023066 |
oct | 256622375632060 |
9 | 46467027513775 |
10 | 12011211011120 |
11 | 3910a20536452 |
12 | 141ba2a322128 |
13 | 691863258389 |
14 | 2d74ba8da036 |
15 | 15c68c291965 |
hex | aec93f73430 |
12011211011120 has 40 divisors (see below), whose sum is σ = 27932648069616. Its totient is φ = 4803351936768.
The previous prime is 12011211011117. The next prime is 12011211011161. The reversal of 12011211011120 is 2111011211021.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 12011211011095 and 12011211011104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17353247 + ... + 18032126.
Almost surely, 212011211011120 is an apocalyptic number.
12011211011120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12011211011120 is an abundant number, since it is smaller than the sum of its proper divisors (15921437058496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011211011120 is a wasteful number, since it uses less digits than its factorization.
12011211011120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35389629 (or 35389623 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12011211011120 its reverse (2111011211021), we get a palindrome (14122222222141).
The spelling of 12011211011120 in words is "twelve trillion, eleven billion, two hundred eleven million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •