Base | Representation |
---|---|
bin | 11011011000011111100100… |
… | …011010011000001000111001 |
3 | 120210102000222001012020121222 |
4 | 123120133210122120020321 |
5 | 111241113000023214114 |
6 | 1104044545442041425 |
7 | 34236545036015642 |
oct | 3330374432301071 |
9 | 523360861166558 |
10 | 120430420132409 |
11 | 35411288606302 |
12 | 11610280049275 |
13 | 52277031a015a |
14 | 21a4c133a26c9 |
15 | ddca119b698e |
hex | 6d87e4698239 |
120430420132409 has 2 divisors, whose sum is σ = 120430420132410. Its totient is φ = 120430420132408.
The previous prime is 120430420132391. The next prime is 120430420132433. The reversal of 120430420132409 is 904231024034021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67822554348025 + 52607865784384 = 8235445^2 + 7253128^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120430420132409 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (120430420132459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60215210066204 + 60215210066205.
It is an arithmetic number, because the mean of its divisors is an integer number (60215210066205).
Almost surely, 2120430420132409 is an apocalyptic number.
It is an amenable number.
120430420132409 is a deficient number, since it is larger than the sum of its proper divisors (1).
120430420132409 is an equidigital number, since it uses as much as digits as its factorization.
120430420132409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
The spelling of 120430420132409 in words is "one hundred twenty trillion, four hundred thirty billion, four hundred twenty million, one hundred thirty-two thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •