Base | Representation |
---|---|
bin | 11011100011101100010100… |
… | …001100100100111101010011 |
3 | 120220010121102211221101120202 |
4 | 123203230110030210331103 |
5 | 111341220120331423001 |
6 | 1105434304310525415 |
7 | 34346261335125212 |
oct | 3343542414447523 |
9 | 526117384841522 |
10 | 121200020967251 |
11 | 35688705181306 |
12 | 1171546196686b |
13 | 5282161176125 |
14 | 21d0180295079 |
15 | e02a560d396b |
hex | 6e3b14324f53 |
121200020967251 has 2 divisors, whose sum is σ = 121200020967252. Its totient is φ = 121200020967250.
The previous prime is 121200020967229. The next prime is 121200020967269. The reversal of 121200020967251 is 152769020002121.
It is a strong prime.
It is an emirp because it is prime and its reverse (152769020002121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121200020967251 - 242 = 116801974456147 is a prime.
It is a super-2 number, since 2×1212000209672512 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (121200020967271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60600010483625 + 60600010483626.
It is an arithmetic number, because the mean of its divisors is an integer number (60600010483626).
Almost surely, 2121200020967251 is an apocalyptic number.
121200020967251 is a deficient number, since it is larger than the sum of its proper divisors (1).
121200020967251 is an equidigital number, since it uses as much as digits as its factorization.
121200020967251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30240, while the sum is 38.
Adding to 121200020967251 its reverse (152769020002121), we get a palindrome (273969040969372).
The spelling of 121200020967251 in words is "one hundred twenty-one trillion, two hundred billion, twenty million, nine hundred sixty-seven thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •