Base | Representation |
---|---|
bin | 110001011011100100… |
… | …0000100010000111101 |
3 | 101010222212212222111122 |
4 | 1202313020010100331 |
5 | 3214344244412003 |
6 | 120433152200325 |
7 | 10445351242334 |
oct | 1426710042075 |
9 | 333885788448 |
10 | 106151560253 |
11 | 410228743a2 |
12 | 186a5b390a5 |
13 | a01910261b |
14 | 51d0042d1b |
15 | 2b6430e238 |
hex | 18b720443d |
106151560253 has 4 divisors (see below), whose sum is σ = 106152845340. Its totient is φ = 106150275168.
The previous prime is 106151560243. The next prime is 106151560261. The reversal of 106151560253 is 352065151601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22813685764 + 83337874489 = 151042^2 + 288683^2 .
It is a cyclic number.
It is not a de Polignac number, because 106151560253 - 218 = 106151298109 is a prime.
It is a super-3 number, since 3×1061515602533 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106151560223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 509450 + ... + 686907.
It is an arithmetic number, because the mean of its divisors is an integer number (26538211335).
Almost surely, 2106151560253 is an apocalyptic number.
It is an amenable number.
106151560253 is a deficient number, since it is larger than the sum of its proper divisors (1285087).
106151560253 is an equidigital number, since it uses as much as digits as its factorization.
106151560253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1285086.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 106151560253 in words is "one hundred six billion, one hundred fifty-one million, five hundred sixty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •