Base | Representation |
---|---|
bin | 1010111011010100001000… |
… | …1100100110001101011111 |
3 | 1120112112120122221001211122 |
4 | 2232311002030212031133 |
5 | 3033314421314003112 |
6 | 41315114513241155 |
7 | 2346664305053141 |
oct | 256650214461537 |
9 | 46475518831748 |
10 | 12014134125407 |
11 | 3912190562487 |
12 | 14205052631bb |
13 | 691c0aa2cbbb |
14 | 2d76b6c0ac91 |
15 | 15c7adbe9872 |
hex | aed4232635f |
12014134125407 has 8 divisors (see below), whose sum is σ = 12453321270000. Its totient is φ = 11576607424704.
The previous prime is 12014134125341. The next prime is 12014134125589. The reversal of 12014134125407 is 70452143141021.
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 12014134125407 - 28 = 12014134125151 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 (12014134125607) 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, 415096238 + ... + 415125179.
It is an arithmetic number, because the mean of its divisors is an integer number (1556665158750).
Almost surely, 212014134125407 is an apocalyptic number.
12014134125407 is a deficient number, since it is larger than the sum of its proper divisors (439187144593).
12014134125407 is an equidigital number, since it uses as much as digits as its factorization.
12014134125407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830221945.
The product of its (nonzero) digits is 26880, while the sum is 35.
Adding to 12014134125407 its reverse (70452143141021), we get a palindrome (82466277266428).
The spelling of 12014134125407 in words is "twelve trillion, fourteen billion, one hundred thirty-four million, one hundred twenty-five thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •