Base | Representation |
---|---|
bin | 1010111011001100101011… |
… | …0100001010110101010110 |
3 | 1120112100102002010121010110 |
4 | 2232303022310022311112 |
5 | 3033301321043424420 |
6 | 41314144044303450 |
7 | 2346563544544041 |
oct | 256631264126526 |
9 | 46470362117113 |
10 | 12012131233110 |
11 | 3911352a1a898 |
12 | 1420046541b86 |
13 | 69197bab2228 |
14 | 2d7566bdbc58 |
15 | 15c6e2e64ee0 |
hex | aeccad0ad56 |
12012131233110 has 64 divisors (see below), whose sum is σ = 29246456678400. Its totient is φ = 3157009295232.
The previous prime is 12012131233097. The next prime is 12012131233129. The reversal of 12012131233110 is 1133213121021.
It is a super-2 number, since 2×120121312331102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 3229650 + ... + 5869829.
It is an arithmetic number, because the mean of its divisors is an integer number (456975885600).
Almost surely, 212012131233110 is an apocalyptic number.
12012131233110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12012131233110 is an abundant number, since it is smaller than the sum of its proper divisors (17234325445290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012131233110 is a wasteful number, since it uses less digits than its factorization.
12012131233110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9100125.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 12012131233110 its reverse (1133213121021), we get a palindrome (13145344354131).
The spelling of 12012131233110 in words is "twelve trillion, twelve billion, one hundred thirty-one million, two hundred thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •