Base | Representation |
---|---|
bin | 1010111010100011100101… |
… | …0100001001111101100001 |
3 | 1120111021221022022120012121 |
4 | 2232220321110021331201 |
5 | 3033111223123210032 |
6 | 41305121311224241 |
7 | 2346023310441622 |
oct | 256507124117541 |
9 | 46437838276177 |
10 | 12001100210017 |
11 | 3907702222986 |
12 | 1419a88218081 |
13 | 690911615029 |
14 | 2d6bdbb73a49 |
15 | 15c2997e8a97 |
hex | aea39509f61 |
12001100210017 has 2 divisors, whose sum is σ = 12001100210018. Its totient is φ = 12001100210016.
The previous prime is 12001100209993. The next prime is 12001100210027. The reversal of 12001100210017 is 71001200110021.
12001100210017 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., 8458784743201 + 3542315466816 = 2908399^2 + 1882104^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12001100210017 is a prime.
It is not a weakly prime, because it can be changed into another prime (12001100210027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000550105008 + 6000550105009.
It is an arithmetic number, because the mean of its divisors is an integer number (6000550105009).
Almost surely, 212001100210017 is an apocalyptic number.
It is an amenable number.
12001100210017 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001100210017 is an equidigital number, since it uses as much as digits as its factorization.
12001100210017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 12001100210017 its reverse (71001200110021), we get a palindrome (83002300320038).
The spelling of 12001100210017 in words is "twelve trillion, one billion, one hundred million, two hundred ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •