Base | Representation |
---|---|
bin | 10010110100010010… |
… | …10010110000111111 |
3 | 222002001022001001002 |
4 | 21122021102300333 |
5 | 131142143221231 |
6 | 4350235440515 |
7 | 505226206355 |
oct | 113211226077 |
9 | 28061261032 |
10 | 10102320191 |
11 | 4314550757 |
12 | 1b5b2b613b |
13 | c4cc64072 |
14 | 6bb9997d5 |
15 | 3e1d700cb |
hex | 25a252c3f |
10102320191 has 2 divisors, whose sum is σ = 10102320192. Its totient is φ = 10102320190.
The previous prime is 10102320169. The next prime is 10102320307. The reversal of 10102320191 is 19102320101.
10102320191 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 is an emirp because it is prime and its reverse (19102320101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10102320191 - 226 = 10035211327 is a prime.
It is a super-3 number, since 3×101023201913 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10102320391) 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, 5051160095 + 5051160096.
It is an arithmetic number, because the mean of its divisors is an integer number (5051160096).
Almost surely, 210102320191 is an apocalyptic number.
10102320191 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102320191 is an equidigital number, since it uses as much as digits as its factorization.
10102320191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10102320191 its reverse (19102320101), we get a palindrome (29204640292).
The spelling of 10102320191 in words is "ten billion, one hundred two million, three hundred twenty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •