Base | Representation |
---|---|
bin | 111000100011101010… |
… | …0010111110010000111 |
3 | 102121111110011002210211 |
4 | 1301013110113302013 |
5 | 3442220113410134 |
6 | 131443531100251 |
7 | 11526532424233 |
oct | 1610724276207 |
9 | 377443132724 |
10 | 121455606919 |
11 | 47566584149 |
12 | 1b6572a1687 |
13 | b5b793533a |
14 | 5c427b15c3 |
15 | 325cb81764 |
hex | 1c47517c87 |
121455606919 has 2 divisors, whose sum is σ = 121455606920. Its totient is φ = 121455606918.
The previous prime is 121455606829. The next prime is 121455606941. The reversal of 121455606919 is 919606554121.
It is a strong prime.
It is an emirp because it is prime and its reverse (919606554121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121455606919 - 29 = 121455606407 is a prime.
It is a super-2 number, since 2×1214556069192 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121455606989) 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, 60727803459 + 60727803460.
It is an arithmetic number, because the mean of its divisors is an integer number (60727803460).
Almost surely, 2121455606919 is an apocalyptic number.
121455606919 is a deficient number, since it is larger than the sum of its proper divisors (1).
121455606919 is an equidigital number, since it uses as much as digits as its factorization.
121455606919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 49.
The spelling of 121455606919 in words is "one hundred twenty-one billion, four hundred fifty-five million, six hundred six thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •