Base | Representation |
---|---|
bin | 10011100010110000… |
… | …11010110001001111 |
3 | 1000002012212000020101 |
4 | 21301120122301033 |
5 | 132441443123403 |
6 | 4453043231531 |
7 | 521001616654 |
oct | 116130326117 |
9 | 30065760211 |
10 | 10492161103 |
11 | 44a4607a26 |
12 | 20499785a7 |
13 | cb2959568 |
14 | 717677c2b |
15 | 4161c871d |
hex | 27161ac4f |
10492161103 has 2 divisors, whose sum is σ = 10492161104. Its totient is φ = 10492161102.
The previous prime is 10492161067. The next prime is 10492161109. The reversal of 10492161103 is 30116129401.
10492161103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10492161103 - 213 = 10492152911 is a prime.
It is a super-2 number, since 2×104921611032 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10492161109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5246080551 + 5246080552.
It is an arithmetic number, because the mean of its divisors is an integer number (5246080552).
Almost surely, 210492161103 is an apocalyptic number.
10492161103 is a deficient number, since it is larger than the sum of its proper divisors (1).
10492161103 is an equidigital number, since it uses as much as digits as its factorization.
10492161103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 10492161103 in words is "ten billion, four hundred ninety-two million, one hundred sixty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •