Base | Representation |
---|---|
bin | 110110101000111001100101… |
… | …011001111100111111001101 |
3 | 1011111211221112002111221021021 |
4 | 312220321211121330333031 |
5 | 222444124342101412141 |
6 | 2211030352050434141 |
7 | 101421320633425006 |
oct | 6650714531747715 |
9 | 1144757462457237 |
10 | 240305121513421 |
11 | 6a628914397538 |
12 | 22b508aab92951 |
13 | a4118a274a853 |
14 | 434ab894d41ad |
15 | 1cbad4adc56d1 |
hex | da8e6567cfcd |
240305121513421 has 2 divisors, whose sum is σ = 240305121513422. Its totient is φ = 240305121513420.
The previous prime is 240305121513371. The next prime is 240305121513437. The reversal of 240305121513421 is 124315121503042.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129632912066025 + 110672209447396 = 11385645^2 + 10520086^2 .
It is a cyclic number.
It is not a de Polignac number, because 240305121513421 - 221 = 240305119416269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (240305121514421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120152560756710 + 120152560756711.
It is an arithmetic number, because the mean of its divisors is an integer number (120152560756711).
Almost surely, 2240305121513421 is an apocalyptic number.
It is an amenable number.
240305121513421 is a deficient number, since it is larger than the sum of its proper divisors (1).
240305121513421 is an equidigital number, since it uses as much as digits as its factorization.
240305121513421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 240305121513421 in words is "two hundred forty trillion, three hundred five billion, one hundred twenty-one million, five hundred thirteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •