Base | Representation |
---|---|
bin | 110110000001101110… |
… | …1010001011000100101 |
3 | 102002110210002110202102 |
4 | 1230003131101120211 |
5 | 3400103130401041 |
6 | 125144432421445 |
7 | 11245064523341 |
oct | 1540335213045 |
9 | 362423073672 |
10 | 116022122021 |
11 | 45228510563 |
12 | 1a59b6a7885 |
13 | ac3003cc10 |
14 | 5888d10621 |
15 | 3040b5009b |
hex | 1b03751625 |
116022122021 has 16 divisors (see below), whose sum is σ = 126886276608. Its totient is φ = 105436900800.
The previous prime is 116022122017. The next prime is 116022122023. The reversal of 116022122021 is 120221220611.
It is a cyclic number.
It is not a de Polignac number, because 116022122021 - 22 = 116022122017 is a prime.
It is a super-2 number, since 2×1160221220212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116022121984 and 116022122002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116022122023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1478156 + ... + 1554666.
It is an arithmetic number, because the mean of its divisors is an integer number (7930392288).
Almost surely, 2116022122021 is an apocalyptic number.
It is an amenable number.
116022122021 is a deficient number, since it is larger than the sum of its proper divisors (10864154587).
116022122021 is a wasteful number, since it uses less digits than its factorization.
116022122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78332.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 116022122021 its reverse (120221220611), we get a palindrome (236243342632).
The spelling of 116022122021 in words is "one hundred sixteen billion, twenty-two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •