Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …0001001011001000001101 |
3 | 1022210111200100112002021112 |
4 | 2103013223001023020031 |
5 | 2311120240224012343 |
6 | 33300245332141405 |
7 | 2062265151414116 |
oct | 223075301131015 |
9 | 38714610462245 |
10 | 10110001000973 |
11 | 3248699aa8185 |
12 | 1173476a67865 |
13 | 5844a4915c03 |
14 | 26d4804d320d |
15 | 127eb7187218 |
hex | 931eb04b20d |
10110001000973 has 2 divisors, whose sum is σ = 10110001000974. Its totient is φ = 10110001000972.
The previous prime is 10110001000943. The next prime is 10110001001027. The reversal of 10110001000973 is 37900010001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8955876213769 + 1154124787204 = 2992637^2 + 1074302^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110001000973 - 210 = 10110000999949 is a prime.
It is a super-3 number, since 3×101100010009733 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110001000943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055000500486 + 5055000500487.
It is an arithmetic number, because the mean of its divisors is an integer number (5055000500487).
Almost surely, 210110001000973 is an apocalyptic number.
It is an amenable number.
10110001000973 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110001000973 is an equidigital number, since it uses as much as digits as its factorization.
10110001000973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189, while the sum is 23.
The spelling of 10110001000973 in words is "ten trillion, one hundred ten billion, one million, nine hundred seventy-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.260 sec. • engine limits •