Base | Representation |
---|---|
bin | 110001101001011000… |
… | …0001011101000111011 |
3 | 101012012012001021001212 |
4 | 1203102300023220323 |
5 | 3221321423423201 |
6 | 120551150433335 |
7 | 10463010031532 |
oct | 1432260135073 |
9 | 335165037055 |
10 | 106615061051 |
11 | 41240471404 |
12 | 187b520284b |
13 | a091148455 |
14 | 5235817319 |
15 | 2b8ed67abb |
hex | 18d2c0ba3b |
106615061051 has 8 divisors (see below), whose sum is σ = 111503927040. Its totient is φ = 101747314152.
The previous prime is 106615061041. The next prime is 106615061053. The reversal of 106615061051 is 150160516601.
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-106615061051 is a prime.
It is a super-2 number, since 2×1066150610512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106615060999 and 106615061017.
It is not an unprimeable number, because it can be changed into a prime (106615061053) 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, 5269445 + ... + 5289638.
It is an arithmetic number, because the mean of its divisors is an integer number (13937990880).
Almost surely, 2106615061051 is an apocalyptic number.
106615061051 is a deficient number, since it is larger than the sum of its proper divisors (4888865989).
106615061051 is a wasteful number, since it uses less digits than its factorization.
106615061051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10559545.
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 106615061051 its reverse (150160516601), we get a palindrome (256775577652).
The spelling of 106615061051 in words is "one hundred six billion, six hundred fifteen million, sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •