Base | Representation |
---|---|
bin | 1101111100110… |
… | …11000011000100 |
3 | 22011012120212210 |
4 | 12332123003010 |
5 | 214424331022 |
6 | 15340143420 |
7 | 2620466424 |
oct | 676330304 |
9 | 264176783 |
10 | 117027012 |
11 | 60071143 |
12 | 33237b70 |
13 | 1b32596b |
14 | 11784484 |
15 | a419a0c |
hex | 6f9b0c4 |
117027012 has 24 divisors (see below), whose sum is σ = 276355296. Its totient is φ = 38538688.
The previous prime is 117027011. The next prime is 117027017. The reversal of 117027012 is 210720711.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 117027012.
It is not an unprimeable number, because it can be changed into a prime (117027011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57753 + ... + 59744.
It is an arithmetic number, because the mean of its divisors is an integer number (11514804).
Almost surely, 2117027012 is an apocalyptic number.
117027012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
117027012 is an abundant number, since it is smaller than the sum of its proper divisors (159328284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117027012 is a wasteful number, since it uses less digits than its factorization.
117027012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117587 (or 117585 counting only the distinct ones).
The product of its (nonzero) digits is 196, while the sum is 21.
The square root of 117027012 is about 10817.9023844736. The cubic root of 117027012 is about 489.1349613470.
Adding to 117027012 its reverse (210720711), we get a palindrome (327747723).
It can be divided in two parts, 1170 and 27012, that added together give a palindrome (28182).
The spelling of 117027012 in words is "one hundred seventeen million, twenty-seven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •