Base | Representation |
---|---|
bin | 101010011001101011… |
… | …0110010011110100001 |
3 | 22201000211210021010100 |
4 | 1110303112302132201 |
5 | 2442440304101103 |
6 | 105455220253013 |
7 | 6402310410354 |
oct | 1246326623641 |
9 | 281024707110 |
10 | 91055925153 |
11 | 35686772306 |
12 | 15792541169 |
13 | 878181076b |
14 | 459b24629b |
15 | 257de085a3 |
hex | 15335b27a1 |
91055925153 has 12 divisors (see below), whose sum is σ = 133488289168. Its totient is φ = 59797920600.
The previous prime is 91055925097. The next prime is 91055925167. The reversal of 91055925153 is 35152955019.
91055925153 is a `hidden beast` number, since 9 + 1 + 0 + 5 + 592 + 5 + 1 + 53 = 666.
It is not a de Polignac number, because 91055925153 - 212 = 91055921057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 91055925099 and 91055925108.
It is not an unprimeable number, because it can be changed into a prime (91055925173) 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 in 11 ways as a sum of consecutive naturals, for example, 75501823 + ... + 75503028.
Almost surely, 291055925153 is an apocalyptic number.
It is an amenable number.
91055925153 is a deficient number, since it is larger than the sum of its proper divisors (42432364015).
91055925153 is a wasteful number, since it uses less digits than its factorization.
91055925153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151004924 (or 151004921 counting only the distinct ones).
The product of its (nonzero) digits is 303750, while the sum is 45.
The spelling of 91055925153 in words is "ninety-one billion, fifty-five million, nine hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •