Base | Representation |
---|---|
bin | 1101110101001… |
… | …01001100110101 |
3 | 22002022102112211 |
4 | 12322211030311 |
5 | 214200120041 |
6 | 15302413421 |
7 | 2606103535 |
oct | 672451465 |
9 | 262272484 |
10 | 116020021 |
11 | 5a543617 |
12 | 32a31271 |
13 | 1b062500 |
14 | 115a14c5 |
15 | a2bb481 |
hex | 6ea5335 |
116020021 has 12 divisors (see below), whose sum is σ = 128011428. Its totient is φ = 105066624.
The previous prime is 116020007. The next prime is 116020033. The reversal of 116020021 is 120020611.
It can be written as a sum of positive squares in 6 ways, for example, as 27941796 + 88078225 = 5286^2 + 9385^2 .
It is not a de Polignac number, because 116020021 - 25 = 116019989 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116019983 and 116020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116020721) 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, 2481 + ... + 15433.
It is an arithmetic number, because the mean of its divisors is an integer number (10667619).
Almost surely, 2116020021 is an apocalyptic number.
It is an amenable number.
116020021 is a deficient number, since it is larger than the sum of its proper divisors (11991407).
116020021 is a wasteful number, since it uses less digits than its factorization.
116020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13032 (or 13019 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 116020021 is about 10771.2590257592. The cubic root of 116020021 is about 487.7279526531.
Adding to 116020021 its reverse (120020611), we get a palindrome (236040632).
The spelling of 116020021 in words is "one hundred sixteen million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •