Base | Representation |
---|---|
bin | 1011101101011001111… |
… | …11101101111111011011 |
3 | 1102110111101001021202211 |
4 | 11312230333231333123 |
5 | 23042440042440011 |
6 | 504455125135551 |
7 | 41032135330060 |
oct | 5665477557733 |
9 | 1373441037684 |
10 | 402334343131 |
11 | 1456a127a9a6 |
12 | 65b84b5a5b7 |
13 | 2bc2b149276 |
14 | 1568a210c67 |
15 | a6eb800b21 |
hex | 5dacfedfdb |
402334343131 has 32 divisors (see below), whose sum is σ = 486007879680. Its totient is φ = 325733654400.
The previous prime is 402334343129. The next prime is 402334343161. The reversal of 402334343131 is 131343433204.
It is not a de Polignac number, because 402334343131 - 21 = 402334343129 is a prime.
It is a super-2 number, since 2×4023343431312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 402334343093 and 402334343102.
It is not an unprimeable number, because it can be changed into a prime (402334343111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24139941 + ... + 24156601.
It is an arithmetic number, because the mean of its divisors is an integer number (15187746240).
Almost surely, 2402334343131 is an apocalyptic number.
402334343131 is a deficient number, since it is larger than the sum of its proper divisors (83673536549).
402334343131 is a wasteful number, since it uses less digits than its factorization.
402334343131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19275.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 402334343131 its reverse (131343433204), we get a palindrome (533677776335).
The spelling of 402334343131 in words is "four hundred two billion, three hundred thirty-four million, three hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •