Base | Representation |
---|---|
bin | 1001001100001111000011… |
… | …1101110110100000010111 |
3 | 1022210002211222120010012022 |
4 | 2103003300331312200113 |
5 | 2311033142242413241 |
6 | 33254313151043355 |
7 | 2062056201130364 |
oct | 223036075664027 |
9 | 38702758503168 |
10 | 10105805826071 |
11 | 3246936a2718a |
12 | 11726a5b1055b |
13 | 583c867394b7 |
14 | 26d1a329546b |
15 | 127d1dc0c54b |
hex | 930f0f76817 |
10105805826071 has 2 divisors, whose sum is σ = 10105805826072. Its totient is φ = 10105805826070.
The previous prime is 10105805826001. The next prime is 10105805826107. The reversal of 10105805826071 is 17062850850101.
10105805826071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (10105805826107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10105805826071 is a prime.
It is a super-2 number, since 2×101058058260712 (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 (10105805826001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5052902913035 + 5052902913036.
It is an arithmetic number, because the mean of its divisors is an integer number (5052902913036).
Almost surely, 210105805826071 is an apocalyptic number.
10105805826071 is a deficient number, since it is larger than the sum of its proper divisors (1).
10105805826071 is an equidigital number, since it uses as much as digits as its factorization.
10105805826071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 134400, while the sum is 44.
The spelling of 10105805826071 in words is "ten trillion, one hundred five billion, eight hundred five million, eight hundred twenty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •