Base | Representation |
---|---|
bin | 110001010111011111… |
… | …1100110001010010111 |
3 | 101010122101011012111122 |
4 | 1202232333212022113 |
5 | 3214104332401241 |
6 | 120411435554155 |
7 | 10442103445355 |
oct | 1425677461227 |
9 | 333571135448 |
10 | 106015122071 |
11 | 40a62855371 |
12 | 186682bb95b |
13 | 9cc6a71581 |
14 | 51b9c887d5 |
15 | 2b5735d04b |
hex | 18aefe6297 |
106015122071 has 8 divisors (see below), whose sum is σ = 106836157824. Its totient is φ = 105194264760.
The previous prime is 106015122047. The next prime is 106015122077. The reversal of 106015122071 is 170221510601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106015122071 - 26 = 106015122007 is a prime.
It is a super-2 number, since 2×1060151220712 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106015122071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106015122077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1305566 + ... + 1384388.
It is an arithmetic number, because the mean of its divisors is an integer number (13354519728).
Almost surely, 2106015122071 is an apocalyptic number.
106015122071 is a deficient number, since it is larger than the sum of its proper divisors (821035753).
106015122071 is a wasteful number, since it uses less digits than its factorization.
106015122071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89221.
The product of its (nonzero) digits is 840, while the sum is 26.
Adding to 106015122071 its reverse (170221510601), we get a palindrome (276236632672).
The spelling of 106015122071 in words is "one hundred six billion, fifteen million, one hundred twenty-two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •