Base | Representation |
---|---|
bin | 10000111011101110… |
… | …00100011111110001 |
3 | 212110120011002100112 |
4 | 20131313010133301 |
5 | 122104233111233 |
6 | 4102025431105 |
7 | 441165314231 |
oct | 103567043761 |
9 | 25416132315 |
10 | 9090910193 |
11 | 3945644422 |
12 | 191863b495 |
13 | b1b560601 |
14 | 62351bcc1 |
15 | 383188048 |
hex | 21ddc47f1 |
9090910193 has 2 divisors, whose sum is σ = 9090910194. Its totient is φ = 9090910192.
The previous prime is 9090910189. The next prime is 9090910201. The reversal of 9090910193 is 3910190909.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9082661809 + 8248384 = 95303^2 + 2872^2 .
It is an emirp because it is prime and its reverse (3910190909) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9090910193 - 22 = 9090910189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9090910193.
It is not a weakly prime, because it can be changed into another prime (9090910133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4545455096 + 4545455097.
It is an arithmetic number, because the mean of its divisors is an integer number (4545455097).
Almost surely, 29090910193 is an apocalyptic number.
It is an amenable number.
9090910193 is a deficient number, since it is larger than the sum of its proper divisors (1).
9090910193 is an equidigital number, since it uses as much as digits as its factorization.
9090910193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19683, while the sum is 41.
The square root of 9090910193 is about 95346.2647039725. The cubic root of 9090910193 is about 2087.0641067615.
The spelling of 9090910193 in words is "nine billion, ninety million, nine hundred ten thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •