Base | Representation |
---|---|
bin | 1010111010100011001111… |
… | …1100000000111101100001 |
3 | 1120111021201000120012022112 |
4 | 2232220303330000331201 |
5 | 3033111032024324432 |
6 | 41305104325445105 |
7 | 2346021133564106 |
oct | 256506374007541 |
9 | 46437630505275 |
10 | 12001009995617 |
11 | 3907666305525 |
12 | 1419a61b70795 |
13 | 6908c8a19626 |
14 | 2d6bcdbacaad |
15 | 15c2919287b2 |
hex | aea33f00f61 |
12001009995617 has 2 divisors, whose sum is σ = 12001009995618. Its totient is φ = 12001009995616.
The previous prime is 12001009995431. The next prime is 12001009995619. The reversal of 12001009995617 is 71659990010021.
12001009995617 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10240614409216 + 1760395586401 = 3200096^2 + 1326799^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12001009995617 is a prime.
Together with 12001009995619, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12001009995619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000504997808 + 6000504997809.
It is an arithmetic number, because the mean of its divisors is an integer number (6000504997809).
Almost surely, 212001009995617 is an apocalyptic number.
It is an amenable number.
12001009995617 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001009995617 is an equidigital number, since it uses as much as digits as its factorization.
12001009995617 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 306180, while the sum is 50.
The spelling of 12001009995617 in words is "twelve trillion, one billion, nine million, nine hundred ninety-five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •