Base | Representation |
---|---|
bin | 1001101011011110110110… |
… | …1010110000010001100001 |
3 | 1101200102110120202202210221 |
4 | 2122313231222300101201 |
5 | 2343332042034301121 |
6 | 34345052555523041 |
7 | 2145622036204222 |
oct | 232675552602141 |
9 | 41612416682727 |
10 | 10642621400161 |
11 | 3433568367373 |
12 | 123a740459481 |
13 | 5c2796c91a2a |
14 | 28b169b93249 |
15 | 136c8b9a3b41 |
hex | 9adedab0461 |
10642621400161 has 2 divisors, whose sum is σ = 10642621400162. Its totient is φ = 10642621400160.
The previous prime is 10642621400143. The next prime is 10642621400197. The reversal of 10642621400161 is 16100412624601.
10642621400161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7208790036561 + 3433831363600 = 2684919^2 + 1853060^2 .
It is a cyclic number.
It is not a de Polignac number, because 10642621400161 - 215 = 10642621367393 is a prime.
It is a super-2 number, since 2×106426214001612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10642621400861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321310700080 + 5321310700081.
It is an arithmetic number, because the mean of its divisors is an integer number (5321310700081).
Almost surely, 210642621400161 is an apocalyptic number.
It is an amenable number.
10642621400161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642621400161 is an equidigital number, since it uses as much as digits as its factorization.
10642621400161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 34.
The spelling of 10642621400161 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-one million, four hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •