Base | Representation |
---|---|
bin | 1011110010001110010100… |
… | …1101100101000011110011 |
3 | 1200212201111010222112020211 |
4 | 2330203211031211003303 |
5 | 3144243343012004432 |
6 | 43320324512444551 |
7 | 2505101052311410 |
oct | 274434515450363 |
9 | 50781433875224 |
10 | 12957466906867 |
11 | 414625a2a535a |
12 | 15532b1549757 |
13 | 72cb64b8a8a2 |
14 | 32b205271107 |
15 | 1770c05d8d47 |
hex | bc8e53650f3 |
12957466906867 has 8 divisors (see below), whose sum is σ = 14809822406912. Its totient is φ = 11105433606600.
The previous prime is 12957466906831. The next prime is 12957466906913. The reversal of 12957466906867 is 76860966475921.
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 12957466906867 - 27 = 12957466906739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12957466906793 and 12957466906802.
It is not an unprimeable number, because it can be changed into a prime (12957466900867) 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, 80463759 + ... + 80624632.
It is an arithmetic number, because the mean of its divisors is an integer number (1851227800864).
Almost surely, 212957466906867 is an apocalyptic number.
12957466906867 is a deficient number, since it is larger than the sum of its proper divisors (1852355500045).
12957466906867 is a wasteful number, since it uses less digits than its factorization.
12957466906867 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161099889.
The product of its (nonzero) digits is 1646023680, while the sum is 76.
The spelling of 12957466906867 in words is "twelve trillion, nine hundred fifty-seven billion, four hundred sixty-six million, nine hundred six thousand, eight hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •