Base | Representation |
---|---|
bin | 1101111000010… |
… | …01100000110101 |
3 | 22010002022011121 |
4 | 12330021200311 |
5 | 214301242101 |
6 | 15315303541 |
7 | 2612434456 |
oct | 674114065 |
9 | 263068147 |
10 | 116430901 |
11 | 5a7a4294 |
12 | 32baabb1 |
13 | 1b177532 |
14 | 1166b12d |
15 | a34d0a1 |
hex | 6f09835 |
116430901 has 4 divisors (see below), whose sum is σ = 116452492. Its totient is φ = 116409312.
The previous prime is 116430893. The next prime is 116430907. The reversal of 116430901 is 109034611.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 33074001 + 83356900 = 5751^2 + 9130^2 .
It is a cyclic number.
It is not a de Polignac number, because 116430901 - 23 = 116430893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116430907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4921 + ... + 16033.
It is an arithmetic number, because the mean of its divisors is an integer number (29113123).
Almost surely, 2116430901 is an apocalyptic number.
It is an amenable number.
116430901 is a deficient number, since it is larger than the sum of its proper divisors (21591).
116430901 is a wasteful number, since it uses less digits than its factorization.
116430901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21590.
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 116430901 is about 10790.3151483170. The cubic root of 116430901 is about 488.3030302911.
The spelling of 116430901 in words is "one hundred sixteen million, four hundred thirty thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.262 sec. • engine limits •