Base | Representation |
---|---|
bin | 110110000010101101… |
… | …0110100110010011101 |
3 | 102002120002000121221000 |
4 | 1230011122310302131 |
5 | 3400140042110122 |
6 | 125152010100513 |
7 | 11245644343554 |
oct | 1540532646235 |
9 | 362502017830 |
10 | 116055035037 |
11 | 452450505a7 |
12 | 1a5aa71a739 |
13 | ac36ac4a86 |
14 | 588d43ad9b |
15 | 30439a20ac |
hex | 1b056b4c9d |
116055035037 has 16 divisors (see below), whose sum is σ = 171939430080. Its totient is φ = 77367303216.
The previous prime is 116055035027. The next prime is 116055035077. The reversal of 116055035037 is 730530550611.
116055035037 is a `hidden beast` number, since 11 + 60 + 5 + 503 + 50 + 37 = 666.
It is not a de Polignac number, because 116055035037 - 24 = 116055035021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116055034992 and 116055035010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116055035027) 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 15 ways as a sum of consecutive naturals, for example, 969358 + ... + 1082480.
It is an arithmetic number, because the mean of its divisors is an integer number (10746214380).
Almost surely, 2116055035037 is an apocalyptic number.
It is an amenable number.
116055035037 is a deficient number, since it is larger than the sum of its proper divisors (55884395043).
116055035037 is a wasteful number, since it uses less digits than its factorization.
116055035037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151129 (or 151123 counting only the distinct ones).
The product of its (nonzero) digits is 47250, while the sum is 36.
Adding to 116055035037 its reverse (730530550611), we get a palindrome (846585585648).
The spelling of 116055035037 in words is "one hundred sixteen billion, fifty-five million, thirty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •