Base | Representation |
---|---|
bin | 11010101000110010111110… |
… | …111110101101110011011011 |
3 | 120100210200200022212011211010 |
4 | 122220302332332231303123 |
5 | 110323412243402433100 |
6 | 1053055115551505003 |
7 | 33451001625154146 |
oct | 3250627676556333 |
9 | 510720608764733 |
10 | 117152732077275 |
11 | 34368216101794 |
12 | 11180b98b28163 |
13 | 504a5bc1b42bb |
14 | 20d031870b05d |
15 | d826287b0750 |
hex | 6a8cbefadcdb |
117152732077275 has 48 divisors (see below), whose sum is σ = 210917441491200. Its totient is φ = 57151822815360.
The previous prime is 117152732077273. The next prime is 117152732077309. The reversal of 117152732077275 is 572770237251711.
It is a happy number.
It is not a de Polignac number, because 117152732077275 - 21 = 117152732077273 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (117152732077273) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1417414599 + ... + 1417497248.
It is an arithmetic number, because the mean of its divisors is an integer number (4394113364400).
Almost surely, 2117152732077275 is an apocalyptic number.
117152732077275 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
117152732077275 is a deficient number, since it is larger than the sum of its proper divisors (93764709413925).
117152732077275 is a wasteful number, since it uses less digits than its factorization.
117152732077275 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2834911908 (or 2834911903 counting only the distinct ones).
The product of its (nonzero) digits is 10084200, while the sum is 57.
The spelling of 117152732077275 in words is "one hundred seventeen trillion, one hundred fifty-two billion, seven hundred thirty-two million, seventy-seven thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •