Base | Representation |
---|---|
bin | 1011010010000000100000… |
… | …1101110110110111111101 |
3 | 1121220210220022202022211021 |
4 | 2310200020031312313331 |
5 | 3111211344332314323 |
6 | 42214153121024141 |
7 | 2420105524164124 |
oct | 264401015666775 |
9 | 47823808668737 |
10 | 12404003401213 |
11 | 3a52565603846 |
12 | 1483b8b785051 |
13 | 6bc900570788 |
14 | 30c4dd73cabb |
15 | 1679cb01205d |
hex | b4808376dfd |
12404003401213 has 8 divisors (see below), whose sum is σ = 12597807727008. Its totient is φ = 12211255230384.
The previous prime is 12404003401189. The next prime is 12404003401259. The reversal of 12404003401213 is 31210430040421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12404003401213 - 225 = 12403969846781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12404003401313) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 264015070 + ... + 264062047.
It is an arithmetic number, because the mean of its divisors is an integer number (1574725965876).
Almost surely, 212404003401213 is an apocalyptic number.
It is an amenable number.
12404003401213 is a deficient number, since it is larger than the sum of its proper divisors (193804325795).
12404003401213 is an equidigital number, since it uses as much as digits as its factorization.
12404003401213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528077483.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 12404003401213 its reverse (31210430040421), we get a palindrome (43614433441634).
The spelling of 12404003401213 in words is "twelve trillion, four hundred four billion, three million, four hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •