Base | Representation |
---|---|
bin | 1001001100001111110010… |
… | …0110011011000110001001 |
3 | 1022210010100120211112200202 |
4 | 2103003330212123012021 |
5 | 2311034042224323311 |
6 | 33254344402341545 |
7 | 2062064061152033 |
oct | 223037446330611 |
9 | 38703316745622 |
10 | 10106001011081 |
11 | 3246a27120608 |
12 | 117273b35a8b5 |
13 | 583cb7cc8ca1 |
14 | 26d1c1182c53 |
15 | 127d30e14e3b |
hex | 930fc99b189 |
10106001011081 has 2 divisors, whose sum is σ = 10106001011082. Its totient is φ = 10106001011080.
The previous prime is 10106001011077. The next prime is 10106001011149. The reversal of 10106001011081 is 18011010060101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10023809281600 + 82191729481 = 3166040^2 + 286691^2 .
It is a cyclic number.
It is not a de Polignac number, because 10106001011081 - 22 = 10106001011077 is a prime.
It is a super-3 number, since 3×101060010110813 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (10106001911081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5053000505540 + 5053000505541.
It is an arithmetic number, because the mean of its divisors is an integer number (5053000505541).
Almost surely, 210106001011081 is an apocalyptic number.
It is an amenable number.
10106001011081 is a deficient number, since it is larger than the sum of its proper divisors (1).
10106001011081 is an equidigital number, since it uses as much as digits as its factorization.
10106001011081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 20.
Adding to 10106001011081 its reverse (18011010060101), we get a palindrome (28117011071182).
The spelling of 10106001011081 in words is "ten trillion, one hundred six billion, one million, eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •