Base | Representation |
---|---|
bin | 110110000011110100… |
… | …0000110100101010110 |
3 | 102002122122201012122211 |
4 | 1230013220012211112 |
5 | 3400224032221410 |
6 | 125155411544034 |
7 | 11246604213103 |
oct | 1540750064526 |
9 | 362578635584 |
10 | 116092070230 |
11 | 45263a466a4 |
12 | 1a5babbb01a |
13 | ac41690ca6 |
14 | 589431baaa |
15 | 3046d6a68a |
hex | 1b07a06956 |
116092070230 has 32 divisors (see below), whose sum is σ = 209900235168. Its totient is φ = 46229568000.
The previous prime is 116092070201. The next prime is 116092070231. The reversal of 116092070230 is 32070290611.
It is a junction number, because it is equal to n+sod(n) for n = 116092070192 and 116092070201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116092070231) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2295294 + ... + 2345326.
It is an arithmetic number, because the mean of its divisors is an integer number (6559382349).
Almost surely, 2116092070230 is an apocalyptic number.
116092070230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116092070230 is a deficient number, since it is larger than the sum of its proper divisors (93808164938).
116092070230 is a wasteful number, since it uses less digits than its factorization.
116092070230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51072.
The product of its (nonzero) digits is 4536, while the sum is 31.
The spelling of 116092070230 in words is "one hundred sixteen billion, ninety-two million, seventy thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •