Base | Representation |
---|---|
bin | 110110100000100000… |
… | …1100101000111110110 |
3 | 102012010202201122212202 |
4 | 1231001001211013312 |
5 | 3404212043101410 |
6 | 125435131544502 |
7 | 11312506340006 |
oct | 1550101450766 |
9 | 365122648782 |
10 | 117055050230 |
11 | 45708584838 |
12 | 1a8295bb132 |
13 | b066038b41 |
14 | 5946190006 |
15 | 30a1687ca5 |
hex | 1b410651f6 |
117055050230 has 128 divisors (see below), whose sum is σ = 236473509888. Its totient is φ = 41489344512.
The previous prime is 117055050227. The next prime is 117055050251. The reversal of 117055050230 is 32050550711.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 117055050193 and 117055050202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 121049207 + ... + 121050173.
It is an arithmetic number, because the mean of its divisors is an integer number (1847449296).
Almost surely, 2117055050230 is an apocalyptic number.
117055050230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
117055050230 is an abundant number, since it is smaller than the sum of its proper divisors (119418459658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117055050230 is a wasteful number, since it uses less digits than its factorization.
117055050230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1470.
The product of its (nonzero) digits is 5250, while the sum is 29.
The spelling of 117055050230 in words is "one hundred seventeen billion, fifty-five million, fifty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •