Base | Representation |
---|---|
bin | 110110001101000001… |
… | …1000011101011110011 |
3 | 102010110012020212122200 |
4 | 1230122003003223303 |
5 | 3401342142014011 |
6 | 125250212034243 |
7 | 11260346150523 |
oct | 1543203035363 |
9 | 363405225580 |
10 | 116401126131 |
11 | 454024459a4 |
12 | 1a686602983 |
13 | ac9070c9c4 |
14 | 58c33ab683 |
15 | 3064067856 |
hex | 1b1a0c3af3 |
116401126131 has 12 divisors (see below), whose sum is σ = 168517961040. Its totient is φ = 77423981040.
The previous prime is 116401126117. The next prime is 116401126201. The reversal of 116401126131 is 131621104611.
116401126131 is a `hidden beast` number, since 1 + 1 + 6 + 40 + 1 + 1 + 2 + 613 + 1 = 666.
It is not a de Polignac number, because 116401126131 - 219 = 116400601843 is a prime.
It is a super-2 number, since 2×1164011261312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116401126095 and 116401126104.
It is not an unprimeable number, because it can be changed into a prime (116401126111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14726640 + ... + 14734541.
It is an arithmetic number, because the mean of its divisors is an integer number (14043163420).
Almost surely, 2116401126131 is an apocalyptic number.
116401126131 is a deficient number, since it is larger than the sum of its proper divisors (52116834909).
116401126131 is a wasteful number, since it uses less digits than its factorization.
116401126131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29461626 (or 29461623 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The spelling of 116401126131 in words is "one hundred sixteen billion, four hundred one million, one hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •