Base | Representation |
---|---|
bin | 101101101101001010000000… |
… | …0100111010000100010000011 |
3 | 1221201110201210111021222222011 |
4 | 1123122110000213100202003 |
5 | 410143331302023032121 |
6 | 3543014121020353351 |
7 | 150452511455306305 |
oct | 13332240047204203 |
9 | 1851421714258864 |
10 | 402030424033411 |
11 | 107110166501048 |
12 | 391102336a5857 |
13 | 143433c9c81a54 |
14 | 713c53a9a1975 |
15 | 3172b020947e1 |
hex | 16da5009d0883 |
402030424033411 has 2 divisors, whose sum is σ = 402030424033412. Its totient is φ = 402030424033410.
The previous prime is 402030424033373. The next prime is 402030424033463. The reversal of 402030424033411 is 114330424030204.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 402030424033411 - 221 = 402030421936259 is a prime.
It is a super-3 number, since 3×4020304240334113 (a number of 45 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (402030424033111) 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, 201015212016705 + 201015212016706.
It is an arithmetic number, because the mean of its divisors is an integer number (201015212016706).
Almost surely, 2402030424033411 is an apocalyptic number.
402030424033411 is a deficient number, since it is larger than the sum of its proper divisors (1).
402030424033411 is an equidigital number, since it uses as much as digits as its factorization.
402030424033411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 402030424033411 its reverse (114330424030204), we get a palindrome (516360848063615).
The spelling of 402030424033411 in words is "four hundred two trillion, thirty billion, four hundred twenty-four million, thirty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •