Base | Representation |
---|---|
bin | 1011000000111101000010… |
… | …0100110111010100100010 |
3 | 1120212210122020222201102201 |
4 | 2300033100210313110202 |
5 | 3041411323101212010 |
6 | 41431415553203414 |
7 | 2356664112403342 |
oct | 260172044672442 |
9 | 46783566881381 |
10 | 12111012132130 |
11 | 394a28468484a |
12 | 143724156056a |
13 | 69b0a97b3b32 |
14 | 2dc26738ad22 |
15 | 16007dce423a |
hex | b03d0937522 |
12111012132130 has 16 divisors (see below), whose sum is σ = 22169310344640. Its totient is φ = 4762296295792.
The previous prime is 12111012132061. The next prime is 12111012132179. The reversal of 12111012132130 is 3123121011121.
It is a super-2 number, since 2×121110121321302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12111012132098 and 12111012132107.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 10263569014 + ... + 10263570193.
It is an arithmetic number, because the mean of its divisors is an integer number (1385581896540).
Almost surely, 212111012132130 is an apocalyptic number.
12111012132130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12111012132130 is a deficient number, since it is larger than the sum of its proper divisors (10058298212510).
12111012132130 is a wasteful number, since it uses less digits than its factorization.
12111012132130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20527139273.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 12111012132130 its reverse (3123121011121), we get a palindrome (15234133143251).
The spelling of 12111012132130 in words is "twelve trillion, one hundred eleven billion, twelve million, one hundred thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •