Base | Representation |
---|---|
bin | 11011010101111001100001… |
… | …000101010000010111100001 |
3 | 120202202222202012220121201022 |
4 | 123111321201011100113201 |
5 | 111230202322004333441 |
6 | 1103431021314215225 |
7 | 34220633466306335 |
oct | 3325714105202741 |
9 | 522688665817638 |
10 | 120252123121121 |
11 | 35352703598812 |
12 | 115a1800884515 |
13 | 521395a310644 |
14 | 219a33b8297c5 |
15 | dd8078a5284b |
hex | 6d5e611505e1 |
120252123121121 has 2 divisors, whose sum is σ = 120252123121122. Its totient is φ = 120252123121120.
The previous prime is 120252123121037. The next prime is 120252123121127. The reversal of 120252123121121 is 121121321252021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120175003054096 + 77120067025 = 10962436^2 + 277705^2 .
It is a cyclic number.
It is not a de Polignac number, because 120252123121121 - 218 = 120252122858977 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 (120252123121127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60126061560560 + 60126061560561.
It is an arithmetic number, because the mean of its divisors is an integer number (60126061560561).
Almost surely, 2120252123121121 is an apocalyptic number.
It is an amenable number.
120252123121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
120252123121121 is an equidigital number, since it uses as much as digits as its factorization.
120252123121121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 120252123121121 its reverse (121121321252021), we get a palindrome (241373444373142).
The spelling of 120252123121121 in words is "one hundred twenty trillion, two hundred fifty-two billion, one hundred twenty-three million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •