Base | Representation |
---|---|
bin | 101101101101001111001000… |
… | …0110111011010100010101101 |
3 | 1221201111210012210201110201022 |
4 | 1123122132100313122202231 |
5 | 410144021324113404123 |
6 | 3543023141325023525 |
7 | 150453351346442201 |
oct | 13332362067324255 |
9 | 1851453183643638 |
10 | 402041434122413 |
11 | 1071148a63aa958 |
12 | 391123a69b4ba5 |
13 | 14344462ccc607 |
14 | 713cca2d3ab01 |
15 | 31730489781c8 |
hex | 16da790dda8ad |
402041434122413 has 8 divisors (see below), whose sum is σ = 423273617661600. Its totient is φ = 380816461389168.
The previous prime is 402041434122403. The next prime is 402041434122443. The reversal of 402041434122413 is 314221434140204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 402041434122413 - 210 = 402041434121389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402041434122403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1802587031 + ... + 1802810052.
It is an arithmetic number, because the mean of its divisors is an integer number (52909202207700).
Almost surely, 2402041434122413 is an apocalyptic number.
It is an amenable number.
402041434122413 is a deficient number, since it is larger than the sum of its proper divisors (21232183539187).
402041434122413 is a wasteful number, since it uses less digits than its factorization.
402041434122413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3605402971.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 402041434122413 its reverse (314221434140204), we get a palindrome (716262868262617).
The spelling of 402041434122413 in words is "four hundred two trillion, forty-one billion, four hundred thirty-four million, one hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •