Base | Representation |
---|---|
bin | 111000011111010010… |
… | …1100011001001000111 |
3 | 102121010020111112121101 |
4 | 1300332211203021013 |
5 | 3441420113134301 |
6 | 131421215200531 |
7 | 11523103315033 |
oct | 1607645431107 |
9 | 377106445541 |
10 | 121309114951 |
11 | 474a0918602 |
12 | 1b616216147 |
13 | b5934940bb |
14 | 5c2b15b1c3 |
15 | 324ed96701 |
hex | 1c3e963247 |
121309114951 has 2 divisors, whose sum is σ = 121309114952. Its totient is φ = 121309114950.
The previous prime is 121309114939. The next prime is 121309114957. The reversal of 121309114951 is 159411903121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121309114951 - 29 = 121309114439 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121309114951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121309114957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60654557475 + 60654557476.
It is an arithmetic number, because the mean of its divisors is an integer number (60654557476).
Almost surely, 2121309114951 is an apocalyptic number.
121309114951 is a deficient number, since it is larger than the sum of its proper divisors (1).
121309114951 is an equidigital number, since it uses as much as digits as its factorization.
121309114951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 37.
The spelling of 121309114951 in words is "one hundred twenty-one billion, three hundred nine million, one hundred fourteen thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •