Base | Representation |
---|---|
bin | 110110001000111010… |
… | …0100001111010010111 |
3 | 102010002120112102110210 |
4 | 1230101310201322113 |
5 | 3401101323200210 |
6 | 125224401420503 |
7 | 11254052021244 |
oct | 1542164417227 |
9 | 363076472423 |
10 | 116263100055 |
11 | 45341541963 |
12 | 1a64833a733 |
13 | ac6ac43c7b |
14 | 58acd1c5cb |
15 | 3056da0e20 |
hex | 1b11d21e97 |
116263100055 has 32 divisors (see below), whose sum is σ = 187639170048. Its totient is φ = 61469280000.
The previous prime is 116263100033. The next prime is 116263100059. The reversal of 116263100055 is 550001362611.
It is not a de Polignac number, because 116263100055 - 26 = 116263099991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116263099995 and 116263100031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116263100059) 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 31 ways as a sum of consecutive naturals, for example, 1050355 + ... + 1155755.
It is an arithmetic number, because the mean of its divisors is an integer number (5863724064).
Almost surely, 2116263100055 is an apocalyptic number.
116263100055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116263100055 is a deficient number, since it is larger than the sum of its proper divisors (71376069993).
116263100055 is a wasteful number, since it uses less digits than its factorization.
116263100055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106047.
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 116263100055 its reverse (550001362611), we get a palindrome (666264462666).
The spelling of 116263100055 in words is "one hundred sixteen billion, two hundred sixty-three million, one hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •