Base | Representation |
---|---|
bin | 1011100011101101111100… |
… | …0011010101101100000001 |
3 | 1122222220020011200010012001 |
4 | 2320323133003111230001 |
5 | 3131203001344043001 |
6 | 43010031510304001 |
7 | 2451066263033620 |
oct | 270733703255401 |
9 | 48886204603161 |
10 | 12708255456001 |
11 | 405a5a49a0806 |
12 | 1512b41058001 |
13 | 7124ca2a2821 |
14 | 31d1234876b7 |
15 | 170886b34001 |
hex | b8edf0d5b01 |
12708255456001 has 8 divisors (see below), whose sum is σ = 14524537382784. Its totient is φ = 10892177744640.
The previous prime is 12708255455993. The next prime is 12708255456011. The reversal of 12708255456001 is 10065455280721.
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 12708255456001 - 23 = 12708255455993 is a prime.
It is a super-2 number, since 2×127082554560012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12708255456011) 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, 50920480 + ... + 51169441.
It is an arithmetic number, because the mean of its divisors is an integer number (1815567172848).
Almost surely, 212708255456001 is an apocalyptic number.
It is an amenable number.
12708255456001 is a deficient number, since it is larger than the sum of its proper divisors (1816281926783).
12708255456001 is a wasteful number, since it uses less digits than its factorization.
12708255456001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102107711.
The product of its (nonzero) digits is 672000, while the sum is 46.
The spelling of 12708255456001 in words is "twelve trillion, seven hundred eight billion, two hundred fifty-five million, four hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •