Base | Representation |
---|---|
bin | 110000010011011010101111… |
… | …0100101010101101001110001 |
3 | 2001201101020201012202000212112 |
4 | 1200212311132211111221301 |
5 | 421142223223002244441 |
6 | 4103351424011335105 |
7 | 155331440610342401 |
oct | 14046653645255161 |
9 | 2051336635660775 |
10 | 424881226603121 |
11 | 113420130872162 |
12 | 3b7a09b3151495 |
13 | 15310187888942 |
14 | 76cc50ab9c801 |
15 | 341c2082734eb |
hex | 1826d5e955a71 |
424881226603121 has 2 divisors, whose sum is σ = 424881226603122. Its totient is φ = 424881226603120.
The previous prime is 424881226603111. The next prime is 424881226603181. The reversal of 424881226603121 is 121306622188424.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 399262899886096 + 25618326717025 = 19981564^2 + 5061455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-424881226603121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 424881226603121.
It is not a weakly prime, because it can be changed into another prime (424881226603111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212440613301560 + 212440613301561.
It is an arithmetic number, because the mean of its divisors is an integer number (212440613301561).
Almost surely, 2424881226603121 is an apocalyptic number.
It is an amenable number.
424881226603121 is a deficient number, since it is larger than the sum of its proper divisors (1).
424881226603121 is an equidigital number, since it uses as much as digits as its factorization.
424881226603121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1769472, while the sum is 50.
The spelling of 424881226603121 in words is "four hundred twenty-four trillion, eight hundred eighty-one billion, two hundred twenty-six million, six hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •