Base | Representation |
---|---|
bin | 110110001101001001… |
… | …0000001111010100110 |
3 | 102010110110122021121220 |
4 | 1230122102001322212 |
5 | 3401344143113141 |
6 | 125250432121210 |
7 | 11260424415444 |
oct | 1543222017246 |
9 | 363413567556 |
10 | 116405051046 |
11 | 45404686829 |
12 | 1a687996206 |
13 | ac9148533b |
14 | 58c3b0db94 |
15 | 3064590766 |
hex | 1b1a481ea6 |
116405051046 has 16 divisors (see below), whose sum is σ = 245063265600. Its totient is φ = 36759489768.
The previous prime is 116405051029. The next prime is 116405051047. The reversal of 116405051046 is 640150504611.
It is a junction number, because it is equal to n+sod(n) for n = 116405050998 and 116405051016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116405051047) 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 7 ways as a sum of consecutive naturals, for example, 510548356 + ... + 510548583.
It is an arithmetic number, because the mean of its divisors is an integer number (15316454100).
Almost surely, 2116405051046 is an apocalyptic number.
116405051046 is an abundant number, since it is smaller than the sum of its proper divisors (128658214554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116405051046 is a wasteful number, since it uses less digits than its factorization.
116405051046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021096963.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 116405051046 its reverse (640150504611), we get a palindrome (756555555657).
The spelling of 116405051046 in words is "one hundred sixteen billion, four hundred five million, fifty-one thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •