Base | Representation |
---|---|
bin | 110110111011011001… |
… | …0000010101000100100 |
3 | 102021110121210201221010 |
4 | 1231312302002220210 |
5 | 3413033434241333 |
6 | 130104430422220 |
7 | 11344040334054 |
oct | 1556662025044 |
9 | 367417721833 |
10 | 117956946468 |
11 | 46030691829 |
12 | 1aa3b661970 |
13 | b17ab4765a |
14 | 59cdc81564 |
15 | 310593b563 |
hex | 1b76c82a24 |
117956946468 has 24 divisors (see below), whose sum is σ = 275386944672. Its totient is φ = 39296972224.
The previous prime is 117956946467. The next prime is 117956946469. The reversal of 117956946468 is 864649659711.
It is an interprime number because it is at equal distance from previous prime (117956946467) and next prime (117956946469).
It is a junction number, because it is equal to n+sod(n) for n = 117956946399 and 117956946408.
It is not an unprimeable number, because it can be changed into a prime (117956946463) 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 7 ways as a sum of consecutive naturals, for example, 2728905 + ... + 2771792.
It is an arithmetic number, because the mean of its divisors is an integer number (11474456028).
Almost surely, 2117956946468 is an apocalyptic number.
It is an amenable number.
117956946468 is an abundant number, since it is smaller than the sum of its proper divisors (157429998204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117956946468 is a wasteful number, since it uses less digits than its factorization.
117956946468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5502491 (or 5502489 counting only the distinct ones).
The product of its digits is 78382080, while the sum is 66.
The spelling of 117956946468 in words is "one hundred seventeen billion, nine hundred fifty-six million, nine hundred forty-six thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •