Base | Representation |
---|---|
bin | 101101101101001111011001… |
… | …1010000111000001111100011 |
3 | 1221201111211201000122012220112 |
4 | 1123122132303100320033203 |
5 | 410144024014333114021 |
6 | 3543023314502201535 |
7 | 150453401554635215 |
oct | 13332366320701743 |
9 | 1851454630565815 |
10 | 402042011223011 |
11 | 1071150721380a5 |
12 | 391125281232ab |
13 | 1434452573b163 |
14 | 713cd198425b5 |
15 | 317307e470d5b |
hex | 16da7b34383e3 |
402042011223011 has 4 divisors (see below), whose sum is σ = 402042202242000. Its totient is φ = 402041820204024.
The previous prime is 402042011222989. The next prime is 402042011223059. The reversal of 402042011223011 is 110322110240204.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-402042011223011 is a prime.
It is a super-2 number, since 2×4020420112230112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (402042011223211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92316836 + ... + 96573713.
It is an arithmetic number, because the mean of its divisors is an integer number (100510550560500).
Almost surely, 2402042011223011 is an apocalyptic number.
402042011223011 is a deficient number, since it is larger than the sum of its proper divisors (191018989).
402042011223011 is a wasteful number, since it uses less digits than its factorization.
402042011223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191018988.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 402042011223011 its reverse (110322110240204), we get a palindrome (512364121463215).
The spelling of 402042011223011 in words is "four hundred two trillion, forty-two billion, eleven million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •