Base | Representation |
---|---|
bin | 1100010000111100000… |
… | …11110100110010010001 |
3 | 1111021201212100122220211 |
4 | 12020132003310302101 |
5 | 23401022221123004 |
6 | 521332114404121 |
7 | 42305650240165 |
oct | 6103603646221 |
9 | 1437655318824 |
10 | 421411114129 |
11 | 1527a0651345 |
12 | 69809890641 |
13 | 3097b486445 |
14 | 16579a50ca5 |
15 | ae664a2504 |
hex | 621e0f4c91 |
421411114129 has 2 divisors, whose sum is σ = 421411114130. Its totient is φ = 421411114128.
The previous prime is 421411114121. The next prime is 421411114133. The reversal of 421411114129 is 921411114124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 353406470400 + 68004643729 = 594480^2 + 260777^2 .
It is a cyclic number.
It is not a de Polignac number, because 421411114129 - 23 = 421411114121 is a prime.
It is a super-2 number, since 2×4214111141292 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 421411114129.
It is not a weakly prime, because it can be changed into another prime (421411114121) 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, 210705557064 + 210705557065.
It is an arithmetic number, because the mean of its divisors is an integer number (210705557065).
Almost surely, 2421411114129 is an apocalyptic number.
It is an amenable number.
421411114129 is a deficient number, since it is larger than the sum of its proper divisors (1).
421411114129 is an equidigital number, since it uses as much as digits as its factorization.
421411114129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2304, while the sum is 31.
The spelling of 421411114129 in words is "four hundred twenty-one billion, four hundred eleven million, one hundred fourteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •