Base | Representation |
---|---|
bin | 1101111100000… |
… | …00111101000001 |
3 | 22011000011021011 |
4 | 12332000331001 |
5 | 214412421004 |
6 | 15334000521 |
7 | 2616543004 |
oct | 676007501 |
9 | 264004234 |
10 | 116920129 |
11 | 5aaa8907 |
12 | 331a6141 |
13 | 1b2b9111 |
14 | 1175753b |
15 | a3e8004 |
hex | 6f80f41 |
116920129 has 8 divisors (see below), whose sum is σ = 123187680. Its totient is φ = 110664000.
The previous prime is 116920121. The next prime is 116920157. The reversal of 116920129 is 921029611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116920129 - 23 = 116920121 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 116920129.
It is not an unprimeable number, because it can be changed into a prime (116920121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25449 + ... + 29689.
It is an arithmetic number, because the mean of its divisors is an integer number (15398460).
Almost surely, 2116920129 is an apocalyptic number.
116920129 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
116920129 is a deficient number, since it is larger than the sum of its proper divisors (6267551).
116920129 is a wasteful number, since it uses less digits than its factorization.
116920129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5711.
The product of its (nonzero) digits is 1944, while the sum is 31.
The square root of 116920129 is about 10812.9611577958. The cubic root of 116920129 is about 488.9860038957.
The spelling of 116920129 in words is "one hundred sixteen million, nine hundred twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •