Base | Representation |
---|---|
bin | 110110101101111010… |
… | …1011100011101100110 |
3 | 102020022010010001110112 |
4 | 1231123311130131212 |
5 | 3411122220310422 |
6 | 125551520453022 |
7 | 11326610530604 |
oct | 1553365343546 |
9 | 366263101415 |
10 | 117504853862 |
11 | 45919476980 |
12 | 1a93417a172 |
13 | b108297336 |
14 | 5989bda874 |
15 | 30cadd7ee2 |
hex | 1b5bd5c766 |
117504853862 has 64 divisors (see below), whose sum is σ = 196503729408. Its totient is φ = 52254720000.
The previous prime is 117504853861. The next prime is 117504853871. The reversal of 117504853862 is 268358405711.
It is a super-2 number, since 2×1175048538622 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 117504853862.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117504853861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73393862 + ... + 73395462.
It is an arithmetic number, because the mean of its divisors is an integer number (3070370772).
Almost surely, 2117504853862 is an apocalyptic number.
117504853862 is a deficient number, since it is larger than the sum of its proper divisors (78998875546).
117504853862 is a wasteful number, since it uses less digits than its factorization.
117504853862 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2085.
The product of its (nonzero) digits is 1612800, while the sum is 50.
The spelling of 117504853862 in words is "one hundred seventeen billion, five hundred four million, eight hundred fifty-three thousand, eight hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •