Base | Representation |
---|---|
bin | 110111111100000001… |
… | …0111001011011111001 |
3 | 102111001202120002010011 |
4 | 1233320002321123321 |
5 | 3432004130013410 |
6 | 131103541021521 |
7 | 11451552655162 |
oct | 1577002713371 |
9 | 374052502104 |
10 | 120125626105 |
11 | 46a43869951 |
12 | 1b3459b48a1 |
13 | b435231044 |
14 | 5b57cc8769 |
15 | 31d101d18a |
hex | 1bf80b96f9 |
120125626105 has 4 divisors (see below), whose sum is σ = 144150751332. Its totient is φ = 96100500880.
The previous prime is 120125626081. The next prime is 120125626109. The reversal of 120125626105 is 501626521021.
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 55981452816 + 64144173289 = 236604^2 + 253267^2 .
It is not a de Polignac number, because 120125626105 - 217 = 120125495033 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120125626109) 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, 12012562606 + ... + 12012562615.
It is an arithmetic number, because the mean of its divisors is an integer number (36037687833).
Almost surely, 2120125626105 is an apocalyptic number.
It is an amenable number.
120125626105 is a deficient number, since it is larger than the sum of its proper divisors (24025125227).
120125626105 is an equidigital number, since it uses as much as digits as its factorization.
120125626105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24025125226.
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 120125626105 in words is "one hundred twenty billion, one hundred twenty-five million, six hundred twenty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •