Base | Representation |
---|---|
bin | 110110100010001111… |
… | …0110001000110001100 |
3 | 102012021210211111102110 |
4 | 1231010132301012030 |
5 | 3404321414024400 |
6 | 125445002424020 |
7 | 11314112233200 |
oct | 1550436610614 |
9 | 365253744373 |
10 | 117113033100 |
11 | 45738288168 |
12 | 1a844b02010 |
13 | b07505a92b |
14 | 594db64b00 |
15 | 30a67dce50 |
hex | 1b447b118c |
117113033100 has 108 divisors (see below), whose sum is σ = 394169058024. Its totient is φ = 26768689920.
The previous prime is 117113033077. The next prime is 117113033101. The reversal of 117113033100 is 1330311711.
It is a super-2 number, since 2×1171130331002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (117113033101) 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 35 ways as a sum of consecutive naturals, for example, 3968737 + ... + 3998136.
Almost surely, 2117113033100 is an apocalyptic number.
117113033100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
117113033100 is an abundant number, since it is smaller than the sum of its proper divisors (277056024924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117113033100 is a wasteful number, since it uses less digits than its factorization.
117113033100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7966904 (or 7966890 counting only the distinct ones).
The product of its (nonzero) digits is 189, while the sum is 21.
Adding to 117113033100 its reverse (1330311711), we get a palindrome (118443344811).
The spelling of 117113033100 in words is "one hundred seventeen billion, one hundred thirteen million, thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •