Base | Representation |
---|---|
bin | 10100010111010001110100… |
… | …010110000110010010000111 |
3 | 102202002220120220021220002110 |
4 | 110113101310112012102013 |
5 | 43214330112130144101 |
6 | 514251324245112103 |
7 | 24602353256245464 |
oct | 2427216426062207 |
9 | 382086526256073 |
10 | 89560610006151 |
11 | 2659a494565439 |
12 | a0655430b8633 |
13 | 3ac86b5aba02b |
14 | 1818a8438266b |
15 | a54a24ce3cd6 |
hex | 517474586487 |
89560610006151 has 4 divisors (see below), whose sum is σ = 119414146674872. Its totient is φ = 59707073337432.
The previous prime is 89560610006149. The next prime is 89560610006159. The reversal of 89560610006151 is 15160001606598.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 89560610006151 - 21 = 89560610006149 is a prime.
It is a super-2 number, since 2×895606100061512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 89560610006151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (89560610006159) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14926768334356 + ... + 14926768334361.
It is an arithmetic number, because the mean of its divisors is an integer number (29853536668718).
Almost surely, 289560610006151 is an apocalyptic number.
89560610006151 is a deficient number, since it is larger than the sum of its proper divisors (29853536668721).
89560610006151 is a wasteful number, since it uses less digits than its factorization.
89560610006151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29853536668720.
The product of its (nonzero) digits is 388800, while the sum is 48.
The spelling of 89560610006151 in words is "eighty-nine trillion, five hundred sixty billion, six hundred ten million, six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •