Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0000100001111011100001 |
3 | 1022202112220001200122122001 |
4 | 2102332113200201323201 |
5 | 2310434310030000342 |
6 | 33251514110244001 |
7 | 2061462443332513 |
oct | 222762740417341 |
9 | 38675801618561 |
10 | 10100010000097 |
11 | 324443237a366 |
12 | 1171548ab6601 |
13 | 583571a59884 |
14 | 26cbb3633bb3 |
15 | 127aceea58b7 |
hex | 92f97821ee1 |
10100010000097 has 2 divisors, whose sum is σ = 10100010000098. Its totient is φ = 10100010000096.
The previous prime is 10100010000029. The next prime is 10100010000137. The reversal of 10100010000097 is 79000001000101.
It is a happy number.
10100010000097 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., 8690373827136 + 1409636172961 = 2947944^2 + 1187281^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100010000097 - 27 = 10100009999969 is a prime.
It is not a weakly prime, because it can be changed into another prime (10100010000397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050005000048 + 5050005000049.
It is an arithmetic number, because the mean of its divisors is an integer number (5050005000049).
Almost surely, 210100010000097 is an apocalyptic number.
It is an amenable number.
10100010000097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100010000097 is an equidigital number, since it uses as much as digits as its factorization.
10100010000097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 63, while the sum is 19.
Adding to 10100010000097 its reverse (79000001000101), we get a palindrome (89100011000198).
The spelling of 10100010000097 in words is "ten trillion, one hundred billion, ten million, ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •