Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001100000110011101100001 |
3 | 111020121111122201211212020211 |
4 | 112331233211030012131201 |
5 | 101214241000241320342 |
6 | 554450432053134121 |
7 | 30163003116335002 |
oct | 2675574514063541 |
9 | 436544581755224 |
10 | 101000001120097 |
11 | 2a1aa950627672 |
12 | b3b258802a341 |
13 | 444834a714561 |
14 | 1ad25d746b1a9 |
15 | ba23961a7c17 |
hex | 5bdbe5306761 |
101000001120097 has 2 divisors, whose sum is σ = 101000001120098. Its totient is φ = 101000001120096.
The previous prime is 101000001120071. The next prime is 101000001120119. The reversal of 101000001120097 is 790021100000101.
It is an a-pointer prime, because the next prime (101000001120119) can be obtained adding 101000001120097 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65765222899776 + 35234778220321 = 8109576^2 + 5935889^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000001120097 - 235 = 100965641381729 is a prime.
It is not a weakly prime, because it can be changed into another prime (101000001120047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500000560048 + 50500000560049.
It is an arithmetic number, because the mean of its divisors is an integer number (50500000560049).
Almost surely, 2101000001120097 is an apocalyptic number.
It is an amenable number.
101000001120097 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000001120097 is an equidigital number, since it uses as much as digits as its factorization.
101000001120097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 126, while the sum is 22.
Adding to 101000001120097 its reverse (790021100000101), we get a palindrome (891021101120198).
The spelling of 101000001120097 in words is "one hundred one trillion, one million, one hundred twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •