Base | Representation |
---|---|
bin | 1011010010010000111000… |
… | …1111010000000100010100 |
3 | 1121221020020200121001120020 |
4 | 2310210032033100010110 |
5 | 3111244400221202030 |
6 | 42220201234305140 |
7 | 2420322463424565 |
oct | 264441617200424 |
9 | 47836220531506 |
10 | 12408399397140 |
11 | 3a54410a7862a |
12 | 14849b7a281b0 |
13 | 6c01512310b6 |
14 | 30c7d94d416c |
15 | 167b86e09510 |
hex | b490e3d0114 |
12408399397140 has 48 divisors (see below), whose sum is σ = 34743778198080. Its totient is φ = 3308881754880.
The previous prime is 12408399397133. The next prime is 12408399397159. The reversal of 12408399397140 is 4179399380421.
It is a Harshad number since it is a multiple of its sum of digits (60).
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 15 ways as a sum of consecutive naturals, for example, 8169096 + ... + 9568224.
It is an arithmetic number, because the mean of its divisors is an integer number (723828712460).
Almost surely, 212408399397140 is an apocalyptic number.
12408399397140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12408399397140 is an abundant number, since it is smaller than the sum of its proper divisors (22335378800940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12408399397140 is a wasteful number, since it uses less digits than its factorization.
12408399397140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546952 (or 1546950 counting only the distinct ones).
The product of its (nonzero) digits is 11757312, while the sum is 60.
The spelling of 12408399397140 in words is "twelve trillion, four hundred eight billion, three hundred ninety-nine million, three hundred ninety-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •