Base | Representation |
---|---|
bin | 111000100010101000… |
… | …1111110001100001001 |
3 | 102121102001211101210102 |
4 | 1301011101332030021 |
5 | 3442132341021434 |
6 | 131440310255145 |
7 | 11525636032601 |
oct | 1610521761411 |
9 | 377361741712 |
10 | 121421423369 |
11 | 47549256584 |
12 | 1b6479574b5 |
13 | b5b082709c |
14 | 5c3c033c01 |
15 | 3259b7d07e |
hex | 1c4547e309 |
121421423369 has 2 divisors, whose sum is σ = 121421423370. Its totient is φ = 121421423368.
The previous prime is 121421423359. The next prime is 121421423467. The reversal of 121421423369 is 963324124121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67801389769 + 53620033600 = 260387^2 + 231560^2 .
It is an emirp because it is prime and its reverse (963324124121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121421423369 is a prime.
It is a super-2 number, since 2×1214214233692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121421423309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60710711684 + 60710711685.
It is an arithmetic number, because the mean of its divisors is an integer number (60710711685).
Almost surely, 2121421423369 is an apocalyptic number.
It is an amenable number.
121421423369 is a deficient number, since it is larger than the sum of its proper divisors (1).
121421423369 is an equidigital number, since it uses as much as digits as its factorization.
121421423369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62208, while the sum is 38.
The spelling of 121421423369 in words is "one hundred twenty-one billion, four hundred twenty-one million, four hundred twenty-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •