Base | Representation |
---|---|
bin | 1011000000011101001001… |
… | …0110100100100010110000 |
3 | 1120211222112200121012121122 |
4 | 2300013102112210202300 |
5 | 3041241310203130130 |
6 | 41423442324041412 |
7 | 2356242020462525 |
oct | 260072226444260 |
9 | 46758480535548 |
10 | 12102452005040 |
11 | 3946691712651 |
12 | 1435652833268 |
13 | 69a3441c5b87 |
14 | 2dba9455914c |
15 | 15ec2c5552e5 |
hex | b01d25a48b0 |
12102452005040 has 80 divisors (see below), whose sum is σ = 29619833137920. Its totient is φ = 4586087934720.
The previous prime is 12102452005027. The next prime is 12102452005081. The reversal of 12102452005040 is 4050025420121.
It is a tau number, because it is divible by the number of its divisors (80).
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 15 ways as a sum of consecutive naturals, for example, 113598677 + ... + 113705163.
It is an arithmetic number, because the mean of its divisors is an integer number (370247914224).
Almost surely, 212102452005040 is an apocalyptic number.
12102452005040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12102452005040 is an abundant number, since it is smaller than the sum of its proper divisors (17517381132880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102452005040 is a wasteful number, since it uses less digits than its factorization.
12102452005040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181290 (or 181284 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 26.
Adding to 12102452005040 its reverse (4050025420121), we get a palindrome (16152477425161).
The spelling of 12102452005040 in words is "twelve trillion, one hundred two billion, four hundred fifty-two million, five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •