Base | Representation |
---|---|
bin | 10110110000110101100000… |
… | …111111101100011100001001 |
3 | 111010110201012111102000201002 |
4 | 112300311200333230130021 |
5 | 101110222431110343142 |
6 | 552531141513504345 |
7 | 30041632651325255 |
oct | 2660654077543411 |
9 | 433421174360632 |
10 | 100113020012297 |
11 | 29998769946216 |
12 | b28a6a7a120b5 |
13 | 43b2804213276 |
14 | 1aa16d312b265 |
15 | b89281ab0a32 |
hex | 5b0d60fec709 |
100113020012297 has 2 divisors, whose sum is σ = 100113020012298. Its totient is φ = 100113020012296.
The previous prime is 100113020012219. The next prime is 100113020012309. The reversal of 100113020012297 is 792210020311001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99725568540361 + 387451471936 = 9986269^2 + 622456^2 .
It is a cyclic number.
It is not a de Polignac number, because 100113020012297 - 222 = 100113015817993 is a prime.
It is a super-2 number, since 2×1001130200122972 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100113020011297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50056510006148 + 50056510006149.
It is an arithmetic number, because the mean of its divisors is an integer number (50056510006149).
Almost surely, 2100113020012297 is an apocalyptic number.
It is an amenable number.
100113020012297 is a deficient number, since it is larger than the sum of its proper divisors (1).
100113020012297 is an equidigital number, since it uses as much as digits as its factorization.
100113020012297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 29.
Adding to 100113020012297 its reverse (792210020311001), we get a palindrome (892323040323298).
The spelling of 100113020012297 in words is "one hundred trillion, one hundred thirteen billion, twenty million, twelve thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •