Base | Representation |
---|---|
bin | 11011011011000011101001… |
… | …111100100010110010100001 |
3 | 120211000212201210011212201012 |
4 | 123123003221330202302201 |
5 | 111302004312244243040 |
6 | 1104301524334150305 |
7 | 34255353100410212 |
oct | 3333035174426241 |
9 | 524025653155635 |
10 | 120606606634145 |
11 | 35479a7a267825 |
12 | 1163a450652395 |
13 | 523b200a32348 |
14 | 21ad568915409 |
15 | de23c44d9865 |
hex | 6db0e9f22ca1 |
120606606634145 has 4 divisors (see below), whose sum is σ = 144727927960980. Its totient is φ = 96485285307312.
The previous prime is 120606606634121. The next prime is 120606606634193. The reversal of 120606606634145 is 541436606606021.
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 15759574047889 + 104847032586256 = 3969833^2 + 10239484^2 .
It is a cyclic number.
It is not a de Polignac number, because 120606606634145 - 232 = 120602311666849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120606606634093 and 120606606634102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12060660663410 + ... + 12060660663419.
It is an arithmetic number, because the mean of its divisors is an integer number (36181981990245).
Almost surely, 2120606606634145 is an apocalyptic number.
It is an amenable number.
120606606634145 is a deficient number, since it is larger than the sum of its proper divisors (24121321326835).
120606606634145 is an equidigital number, since it uses as much as digits as its factorization.
120606606634145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24121321326834.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 120606606634145 in words is "one hundred twenty trillion, six hundred six billion, six hundred six million, six hundred thirty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •