Base | Representation |
---|---|
bin | 101001101011010101… |
… | …0110100001011011001 |
3 | 22120000110201111021201 |
4 | 1103112222310023121 |
5 | 2431244212101123 |
6 | 105041030434201 |
7 | 6315626021524 |
oct | 1232652641331 |
9 | 276013644251 |
10 | 89500893913 |
11 | 34a58a15322 |
12 | 15419802961 |
13 | 85945c1032 |
14 | 44908d9bbb |
15 | 24dc63d5ad |
hex | 14d6ab42d9 |
89500893913 has 2 divisors, whose sum is σ = 89500893914. Its totient is φ = 89500893912.
The previous prime is 89500893887. The next prime is 89500893931. The reversal of 89500893913 is 31939800598.
Together with next prime (89500893931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68200367104 + 21300526809 = 261152^2 + 145947^2 .
It is a cyclic number.
It is not a de Polignac number, because 89500893913 - 29 = 89500893401 is a prime.
It is a super-2 number, since 2×895008939132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (89500893943) 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, 44750446956 + 44750446957.
It is an arithmetic number, because the mean of its divisors is an integer number (44750446957).
Almost surely, 289500893913 is an apocalyptic number.
It is an amenable number.
89500893913 is a deficient number, since it is larger than the sum of its proper divisors (1).
89500893913 is an equidigital number, since it uses as much as digits as its factorization.
89500893913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2099520, while the sum is 55.
The spelling of 89500893913 in words is "eighty-nine billion, five hundred million, eight hundred ninety-three thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •