Base | Representation |
---|---|
bin | 1011001011001011101001… |
… | …1000001111000110101001 |
3 | 1121111121012120112010000110 |
4 | 2302302322120033012221 |
5 | 3102301212221211212 |
6 | 42044240345324533 |
7 | 2405454464363421 |
oct | 262627230170651 |
9 | 47447176463013 |
10 | 12286733382057 |
11 | 3a07857752742 |
12 | 1465302196749 |
13 | 6b1831b391b4 |
14 | 306976bd1481 |
15 | 164915a64a3c |
hex | b2cba60f1a9 |
12286733382057 has 32 divisors (see below), whose sum is σ = 17296879057920. Its totient is φ = 7736523382080.
The previous prime is 12286733382023. The next prime is 12286733382059. The reversal of 12286733382057 is 75028333768221.
12286733382057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12286733382057 - 219 = 12286732857769 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 12286733381988 and 12286733382006.
It is not an unprimeable number, because it can be changed into a prime (12286733382059) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25336332 + ... + 25816722.
It is an arithmetic number, because the mean of its divisors is an integer number (540527470560).
Almost surely, 212286733382057 is an apocalyptic number.
It is an amenable number.
12286733382057 is a deficient number, since it is larger than the sum of its proper divisors (5010145675863).
12286733382057 is a wasteful number, since it uses less digits than its factorization.
12286733382057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481773.
The product of its (nonzero) digits is 20321280, while the sum is 57.
The spelling of 12286733382057 in words is "twelve trillion, two hundred eighty-six billion, seven hundred thirty-three million, three hundred eighty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •