Base | Representation |
---|---|
bin | 101010011001111111… |
… | …0110000011011110111 |
3 | 22201001120111120102010 |
4 | 1110303332300123313 |
5 | 2443000444340201 |
6 | 105500233015303 |
7 | 6402465435615 |
oct | 1246376603367 |
9 | 281046446363 |
10 | 91066402551 |
11 | 35691679113 |
12 | 15795b54533 |
13 | 8783a3b6c7 |
14 | 459c7b26b5 |
15 | 257ecc7bd6 |
hex | 1533fb06f7 |
91066402551 has 32 divisors (see below), whose sum is σ = 127448045568. Its totient is φ = 57771878400.
The previous prime is 91066402543. The next prime is 91066402573. The reversal of 91066402551 is 15520466019.
It is not a de Polignac number, because 91066402551 - 23 = 91066402543 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91066402151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8346966 + ... + 8357868.
It is an arithmetic number, because the mean of its divisors is an integer number (3982751424).
Almost surely, 291066402551 is an apocalyptic number.
91066402551 is a deficient number, since it is larger than the sum of its proper divisors (36381643017).
91066402551 is a wasteful number, since it uses less digits than its factorization.
91066402551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12591.
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 91066402551 in words is "ninety-one billion, sixty-six million, four hundred two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •