Base | Representation |
---|---|
bin | 1011101101000011000… |
… | …11001001000000011000 |
3 | 1102102222222200121011221 |
4 | 11312201203021000120 |
5 | 23042041412132412 |
6 | 504424105101424 |
7 | 41024314112056 |
oct | 5664143110030 |
9 | 1372888617157 |
10 | 402142302232 |
11 | 145602933810 |
12 | 65b30787874 |
13 | 2bbca41a8b8 |
14 | 1566c9011d6 |
15 | a6d9a19b07 |
hex | 5da18c9018 |
402142302232 has 128 divisors (see below), whose sum is σ = 873905760000. Its totient is φ = 171566899200.
The previous prime is 402142302179. The next prime is 402142302269. The reversal of 402142302232 is 232203241204.
It is a junction number, because it is equal to n+sod(n) for n = 402142302197 and 402142302206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 132238632 + ... + 132241672.
It is an arithmetic number, because the mean of its divisors is an integer number (6827388750).
Almost surely, 2402142302232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 402142302232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (436952880000).
402142302232 is an abundant number, since it is smaller than the sum of its proper divisors (471763457768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402142302232 is a wasteful number, since it uses less digits than its factorization.
402142302232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3785 (or 3781 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 402142302232 its reverse (232203241204), we get a palindrome (634345543436).
The spelling of 402142302232 in words is "four hundred two billion, one hundred forty-two million, three hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •