Base | Representation |
---|---|
bin | 1001001100011110110000… |
… | …0001101100010011010101 |
3 | 1022210111201112100100200111 |
4 | 2103013230001230103111 |
5 | 2311120304041222234 |
6 | 33300251134443021 |
7 | 2062265445235333 |
oct | 223075401542325 |
9 | 38714645310614 |
10 | 10110017914069 |
11 | 32486a85aa247 |
12 | 1173480663471 |
13 | 5844a8288268 |
14 | 26d482856b53 |
15 | 127eb88c8664 |
hex | 931ec06c4d5 |
10110017914069 has 2 divisors, whose sum is σ = 10110017914070. Its totient is φ = 10110017914068.
The previous prime is 10110017914037. The next prime is 10110017914109. The reversal of 10110017914069 is 96041971001101.
It is an a-pointer prime, because the next prime (10110017914109) can be obtained adding 10110017914069 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6727471625169 + 3382546288900 = 2593737^2 + 1839170^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110017914069 - 25 = 10110017914037 is a prime.
It is a super-2 number, since 2×101100179140692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110017114069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055008957034 + 5055008957035.
It is an arithmetic number, because the mean of its divisors is an integer number (5055008957035).
Almost surely, 210110017914069 is an apocalyptic number.
It is an amenable number.
10110017914069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110017914069 is an equidigital number, since it uses as much as digits as its factorization.
10110017914069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 40.
The spelling of 10110017914069 in words is "ten trillion, one hundred ten billion, seventeen million, nine hundred fourteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •