Base | Representation |
---|---|
bin | 110110001110111000… |
… | …1000011001101010011 |
3 | 102010121112122112100012 |
4 | 1230131301003031103 |
5 | 3402004124430301 |
6 | 125300321145135 |
7 | 11262034352624 |
oct | 1543561031523 |
9 | 363545575305 |
10 | 116463514451 |
11 | 45434688199 |
12 | 1a6a348b1ab |
13 | aca0614a7b |
14 | 58cb7aba4b |
15 | 306978cebb |
hex | 1b1dc43353 |
116463514451 has 2 divisors, whose sum is σ = 116463514452. Its totient is φ = 116463514450.
The previous prime is 116463514393. The next prime is 116463514463. The reversal of 116463514451 is 154415364611.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 116463514451 - 210 = 116463513427 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116463514399 and 116463514408.
It is not a weakly prime, because it can be changed into another prime (116463514151) 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 as a sum of consecutive naturals, namely, 58231757225 + 58231757226.
It is an arithmetic number, because the mean of its divisors is an integer number (58231757226).
Almost surely, 2116463514451 is an apocalyptic number.
116463514451 is a deficient number, since it is larger than the sum of its proper divisors (1).
116463514451 is an equidigital number, since it uses as much as digits as its factorization.
116463514451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 172800, while the sum is 41.
The spelling of 116463514451 in words is "one hundred sixteen billion, four hundred sixty-three million, five hundred fourteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •