Base | Representation |
---|---|
bin | 110001010111001110… |
… | …1011011011001000001 |
3 | 101010121202022010210101 |
4 | 1202232131123121001 |
5 | 3214100034240212 |
6 | 120410520002401 |
7 | 10441634351542 |
oct | 1425635333101 |
9 | 333552263711 |
10 | 106006165057 |
11 | 40a58797881 |
12 | 18665300401 |
13 | 9cc4c56670 |
14 | 51b89d64c9 |
15 | 2b5668e157 |
hex | 18ae75b641 |
106006165057 has 8 divisors (see below), whose sum is σ = 114164812160. Its totient is φ = 97848136080.
The previous prime is 106006165043. The next prime is 106006165129. The reversal of 106006165057 is 750561600601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106006165057 is a prime.
It is a super-2 number, since 2×1060061650572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106006165007) 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 7 ways as a sum of consecutive naturals, for example, 238744 + ... + 518662.
It is an arithmetic number, because the mean of its divisors is an integer number (14270601520).
Almost surely, 2106006165057 is an apocalyptic number.
It is an amenable number.
106006165057 is a deficient number, since it is larger than the sum of its proper divisors (8158647103).
106006165057 is a wasteful number, since it uses less digits than its factorization.
106006165057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309063.
The product of its (nonzero) digits is 37800, while the sum is 37.
Adding to 106006165057 its reverse (750561600601), we get a palindrome (856567765658).
The spelling of 106006165057 in words is "one hundred six billion, six million, one hundred sixty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •