Base | Representation |
---|---|
bin | 1001001011111101100111… |
… | …0010111011110111101001 |
3 | 1022202122202120100020222021 |
4 | 2102333121302323313221 |
5 | 2310444044230334233 |
6 | 33252220315024441 |
7 | 2061532136241205 |
oct | 222773162736751 |
9 | 38678676306867 |
10 | 10101122121193 |
11 | 3244953113404 |
12 | 11717b943b121 |
13 | 5836bb2926ac |
14 | 26cc7b209b05 |
15 | 127b47932e2d |
hex | 92fd9cbbde9 |
10101122121193 has 2 divisors, whose sum is σ = 10101122121194. Its totient is φ = 10101122121192.
The previous prime is 10101122121173. The next prime is 10101122121217. The reversal of 10101122121193 is 39112122110101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8814503779929 + 1286618341264 = 2968923^2 + 1134292^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101122121193 - 233 = 10092532186601 is a prime.
It is a super-3 number, since 3×101011221211933 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10101122121113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050561060596 + 5050561060597.
It is an arithmetic number, because the mean of its divisors is an integer number (5050561060597).
Almost surely, 210101122121193 is an apocalyptic number.
It is an amenable number.
10101122121193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101122121193 is an equidigital number, since it uses as much as digits as its factorization.
10101122121193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 25.
Adding to 10101122121193 its reverse (39112122110101), we get a palindrome (49213244231294).
The spelling of 10101122121193 in words is "ten trillion, one hundred one billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •