Base | Representation |
---|---|
bin | 110110010001011111… |
… | …1100101010001110001 |
3 | 102010211122122221011002 |
4 | 1230202333211101301 |
5 | 3402144102210342 |
6 | 125313132531345 |
7 | 11264150640230 |
oct | 1544277452161 |
9 | 363748587132 |
10 | 116551210097 |
11 | 4547a135233 |
12 | 1a708920b55 |
13 | acb583ab9a |
14 | 58d92b8b17 |
15 | 3072311d32 |
hex | 1b22fe5471 |
116551210097 has 4 divisors (see below), whose sum is σ = 133201382976. Its totient is φ = 99901037220.
The previous prime is 116551210063. The next prime is 116551210103. The reversal of 116551210097 is 790012155611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 790012155611 = 7 ⋅112858879373.
It is a cyclic number.
It is not a de Polignac number, because 116551210097 - 212 = 116551206001 is a prime.
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 116551210097.
It is not an unprimeable number, because it can be changed into a prime (116551210057) 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, 8325086429 + ... + 8325086442.
It is an arithmetic number, because the mean of its divisors is an integer number (33300345744).
Almost surely, 2116551210097 is an apocalyptic number.
It is an amenable number.
116551210097 is a deficient number, since it is larger than the sum of its proper divisors (16650172879).
116551210097 is an equidigital number, since it uses as much as digits as its factorization.
116551210097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16650172878.
The product of its (nonzero) digits is 18900, while the sum is 38.
The spelling of 116551210097 in words is "one hundred sixteen billion, five hundred fifty-one million, two hundred ten thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •