Base | Representation |
---|---|
bin | 1011000101000010000001… |
… | …0110111101010001100000 |
3 | 1121010111110201111021211220 |
4 | 2301100200112331101200 |
5 | 3044033312423444022 |
6 | 41523523435335040 |
7 | 2365024162553550 |
oct | 261204026752140 |
9 | 47114421437756 |
10 | 12181070140512 |
11 | 3976a65597429 |
12 | 14489338b1480 |
13 | 6a4892c5ba70 |
14 | 3017d1983160 |
15 | 161cce56285c |
hex | b14205bd460 |
12181070140512 has 192 divisors, whose sum is σ = 39604894930944. Its totient is φ = 3192127211520.
The previous prime is 12181070140423. The next prime is 12181070140537. The reversal of 12181070140512 is 21504107018121.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3069064 + ... + 5812167.
It is an arithmetic number, because the mean of its divisors is an integer number (206275494432).
Almost surely, 212181070140512 is an apocalyptic number.
12181070140512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12181070140512 is an abundant number, since it is smaller than the sum of its proper divisors (27423824790432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12181070140512 is a wasteful number, since it uses less digits than its factorization.
12181070140512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8881421 (or 8881413 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 33.
Adding to 12181070140512 its reverse (21504107018121), we get a palindrome (33685177158633).
The spelling of 12181070140512 in words is "twelve trillion, one hundred eighty-one billion, seventy million, one hundred forty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •