Base | Representation |
---|---|
bin | 110001100100101110… |
… | …0111010011010110001 |
3 | 101011210022102021220022 |
4 | 1203021130322122301 |
5 | 3221012001433313 |
6 | 120523454053225 |
7 | 10456103460353 |
oct | 1431134723261 |
9 | 334708367808 |
10 | 106459014833 |
11 | 4117037a596 |
12 | 18770aaa215 |
13 | a067a10502 |
14 | 521cbd70d3 |
15 | 2b812e1c08 |
hex | 18c973a6b1 |
106459014833 has 2 divisors, whose sum is σ = 106459014834. Its totient is φ = 106459014832.
The previous prime is 106459014719. The next prime is 106459014859. The reversal of 106459014833 is 338410954601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69135865969 + 37323148864 = 262937^2 + 193192^2 .
It is an emirp because it is prime and its reverse (338410954601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106459014833 - 212 = 106459010737 is a prime.
It is a super-2 number, since 2×1064590148332 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106459011833) 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, 53229507416 + 53229507417.
It is an arithmetic number, because the mean of its divisors is an integer number (53229507417).
Almost surely, 2106459014833 is an apocalyptic number.
It is an amenable number.
106459014833 is a deficient number, since it is larger than the sum of its proper divisors (1).
106459014833 is an equidigital number, since it uses as much as digits as its factorization.
106459014833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 44.
The spelling of 106459014833 in words is "one hundred six billion, four hundred fifty-nine million, fourteen thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •