Base | Representation |
---|---|
bin | 11000001000000110110001… |
… | …111000110011110001110011 |
3 | 111220201000211220100102011120 |
4 | 120020012301320303301303 |
5 | 102402002042241211214 |
6 | 1013402155230513323 |
7 | 31231130321051430 |
oct | 3010066170636163 |
9 | 456630756312146 |
10 | 106110151507059 |
11 | 308a0076270187 |
12 | ba98a37065843 |
13 | 47291b51ab78b |
14 | 1c2ba89d82b87 |
15 | c4027dccaea9 |
hex | 6081b1e33c73 |
106110151507059 has 64 divisors (see below), whose sum is σ = 179173522022400. Its totient is φ = 54459319444992.
The previous prime is 106110151507057. The next prime is 106110151507069. The reversal of 106110151507059 is 950705151011601.
It is not a de Polignac number, because 106110151507059 - 21 = 106110151507057 is a prime.
It is a super-2 number, since 2×1061101515070592 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106110151507059.
It is not an unprimeable number, because it can be changed into a prime (106110151507057) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 50125029 + ... + 52199030.
It is an arithmetic number, because the mean of its divisors is an integer number (2799586281600).
Almost surely, 2106110151507059 is an apocalyptic number.
106110151507059 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
106110151507059 is a deficient number, since it is larger than the sum of its proper divisors (73063370515341).
106110151507059 is a wasteful number, since it uses less digits than its factorization.
106110151507059 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102324224.
The product of its (nonzero) digits is 47250, while the sum is 42.
The spelling of 106110151507059 in words is "one hundred six trillion, one hundred ten billion, one hundred fifty-one million, five hundred seven thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •