Base | Representation |
---|---|
bin | 1101111000100… |
… | …10011111101111 |
3 | 22010011011122100 |
4 | 12330102133233 |
5 | 214303431240 |
6 | 15320150143 |
7 | 2612646651 |
oct | 674223757 |
9 | 263134570 |
10 | 116467695 |
11 | 5a8199a3 |
12 | 33008353 |
13 | 1b18b1c6 |
14 | 1167a6d1 |
15 | a358e30 |
hex | 6f127ef |
116467695 has 24 divisors (see below), whose sum is σ = 202228416. Its totient is φ = 62008128.
The previous prime is 116467691. The next prime is 116467717. The reversal of 116467695 is 596764611.
It is not a de Polignac number, because 116467695 - 22 = 116467691 is a prime.
It is a super-2 number, since 2×1164676952 = 27129447957226050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 116467695.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116467691) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28554 + ... + 32376.
It is an arithmetic number, because the mean of its divisors is an integer number (8426184).
Almost surely, 2116467695 is an apocalyptic number.
116467695 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116467695 is a deficient number, since it is larger than the sum of its proper divisors (85760721).
116467695 is a wasteful number, since it uses less digits than its factorization.
116467695 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4511 (or 4508 counting only the distinct ones).
The product of its digits is 272160, while the sum is 45.
The square root of 116467695 is about 10792.0199684767. The cubic root of 116467695 is about 488.3544620253.
The spelling of 116467695 in words is "one hundred sixteen million, four hundred sixty-seven thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •