Base | Representation |
---|---|
bin | 111000011010100001… |
… | …0011011101001011011 |
3 | 102120201002001111120201 |
4 | 1300311002123221123 |
5 | 3441103110224032 |
6 | 131353253403031 |
7 | 11516116531453 |
oct | 1606502335133 |
9 | 376632044521 |
10 | 121148914267 |
11 | 47419449447 |
12 | 1b590639477 |
13 | b5692331b4 |
14 | 5c13b78d63 |
15 | 3240c9e8e7 |
hex | 1c3509ba5b |
121148914267 has 2 divisors, whose sum is σ = 121148914268. Its totient is φ = 121148914266.
The previous prime is 121148914207. The next prime is 121148914279. The reversal of 121148914267 is 762419841121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121148914267 - 211 = 121148912219 is a prime.
It is a super-2 number, since 2×1211489142672 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121148914207) 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, 60574457133 + 60574457134.
It is an arithmetic number, because the mean of its divisors is an integer number (60574457134).
Almost surely, 2121148914267 is an apocalyptic number.
121148914267 is a deficient number, since it is larger than the sum of its proper divisors (1).
121148914267 is an equidigital number, since it uses as much as digits as its factorization.
121148914267 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 193536, while the sum is 46.
The spelling of 121148914267 in words is "one hundred twenty-one billion, one hundred forty-eight million, nine hundred fourteen thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •