Base | Representation |
---|---|
bin | 1011010010000010000000… |
… | …1001111110000000000101 |
3 | 1121220211221022111102211012 |
4 | 2310200200021332000011 |
5 | 3111213210142110023 |
6 | 42214301025252005 |
7 | 2420121502052135 |
oct | 264404011760005 |
9 | 47824838442735 |
10 | 12404405035013 |
11 | 3a52751295202 |
12 | 1484082194005 |
13 | 6bc965834904 |
14 | 30c53ac0aac5 |
15 | 167a013e9978 |
hex | b482027e005 |
12404405035013 has 4 divisors (see below), whose sum is σ = 12433185557568. Its totient is φ = 12375624512460.
The previous prime is 12404405034997. The next prime is 12404405035031. The reversal of 12404405035013 is 31053050440421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12404405035013 - 24 = 12404405034997 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 (12404405031013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14390260631 + ... + 14390261492.
It is an arithmetic number, because the mean of its divisors is an integer number (3108296389392).
Almost surely, 212404405035013 is an apocalyptic number.
It is an amenable number.
12404405035013 is a deficient number, since it is larger than the sum of its proper divisors (28780522555).
12404405035013 is an equidigital number, since it uses as much as digits as its factorization.
12404405035013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28780522554.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 12404405035013 its reverse (31053050440421), we get a palindrome (43457455475434).
The spelling of 12404405035013 in words is "twelve trillion, four hundred four billion, four hundred five million, thirty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •