Base | Representation |
---|---|
bin | 1101111011111… |
… | …00011000011111 |
3 | 22010222012120202 |
4 | 12331330120133 |
5 | 214411321112 |
6 | 15333334115 |
7 | 2616434300 |
oct | 675743037 |
9 | 263865522 |
10 | 116901407 |
11 | 5aa95837 |
12 | 3319733b |
13 | 1b2b073c |
14 | 117507a7 |
15 | a3e26c2 |
hex | 6f7c61f |
116901407 has 12 divisors (see below), whose sum is σ = 140678280. Its totient is φ = 96744816.
The previous prime is 116901383. The next prime is 116901409. The reversal of 116901407 is 704109611.
It is not a de Polignac number, because 116901407 - 28 = 116901151 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116901407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116901409) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39713 + ... + 42554.
It is an arithmetic number, because the mean of its divisors is an integer number (11723190).
Almost surely, 2116901407 is an apocalyptic number.
116901407 is a deficient number, since it is larger than the sum of its proper divisors (23776873).
116901407 is an equidigital number, since it uses as much as digits as its factorization.
116901407 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82310 (or 82303 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 29.
The square root of 116901407 is about 10812.0954028347. The cubic root of 116901407 is about 488.9599026454.
The spelling of 116901407 in words is "one hundred sixteen million, nine hundred one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •