Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …1010111100001111100001 |
3 | 1022210121021101121022220022 |
4 | 2103020212322330033201 |
5 | 2311124320014000342 |
6 | 33300533152523225 |
7 | 2062332103645532 |
oct | 223104672741741 |
9 | 38717241538808 |
10 | 10111006000097 |
11 | 3249065325972 |
12 | 11736b7550515 |
13 | 584604bb3652 |
14 | 26d537b82689 |
15 | 1280255049d2 |
hex | 93226ebc3e1 |
10111006000097 has 2 divisors, whose sum is σ = 10111006000098. Its totient is φ = 10111006000096.
The previous prime is 10111006000033. The next prime is 10111006000177. The reversal of 10111006000097 is 79000060011101.
10111006000097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8863743657616 + 1247262342481 = 2977204^2 + 1116809^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111006000097 - 26 = 10111006000033 is a prime.
It is not a weakly prime, because it can be changed into another prime (10111006000027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055503000048 + 5055503000049.
It is an arithmetic number, because the mean of its divisors is an integer number (5055503000049).
Almost surely, 210111006000097 is an apocalyptic number.
It is an amenable number.
10111006000097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111006000097 is an equidigital number, since it uses as much as digits as its factorization.
10111006000097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 378, while the sum is 26.
Adding to 10111006000097 its reverse (79000060011101), we get a palindrome (89111066011198).
The spelling of 10111006000097 in words is "ten trillion, one hundred eleven billion, six million, ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •