Base | Representation |
---|---|
bin | 11011011000100010000111… |
… | …010000001101111101111001 |
3 | 120210102022000102222101202212 |
4 | 123120202013100031331321 |
5 | 111241134043422434023 |
6 | 1104050120514504505 |
7 | 34240002531564611 |
oct | 3330420720157571 |
9 | 523368012871685 |
10 | 120433152155513 |
11 | 3541245a78473a |
12 | 11610902b95135 |
13 | 5227a4a1b9682 |
14 | 21a4dd216da41 |
15 | ddcb21774e78 |
hex | 6d888740df79 |
120433152155513 has 2 divisors, whose sum is σ = 120433152155514. Its totient is φ = 120433152155512.
The previous prime is 120433152155501. The next prime is 120433152155527. The reversal of 120433152155513 is 315551251334021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84738597497449 + 35694554658064 = 9205357^2 + 5974492^2 .
It is a cyclic number.
It is not a de Polignac number, because 120433152155513 - 28 = 120433152155257 is a prime.
It is a super-3 number, since 3×1204331521555133 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (120430152155513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60216576077756 + 60216576077757.
It is an arithmetic number, because the mean of its divisors is an integer number (60216576077757).
Almost surely, 2120433152155513 is an apocalyptic number.
It is an amenable number.
120433152155513 is a deficient number, since it is larger than the sum of its proper divisors (1).
120433152155513 is an equidigital number, since it uses as much as digits as its factorization.
120433152155513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 120433152155513 in words is "one hundred twenty trillion, four hundred thirty-three billion, one hundred fifty-two million, one hundred fifty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •