Base | Representation |
---|---|
bin | 1011101100111111101… |
… | …00001011000000011000 |
3 | 1102102220221221200111020 |
4 | 11312133310023000120 |
5 | 23042011440244230 |
6 | 504421145402440 |
7 | 41023511624142 |
oct | 5663764130030 |
9 | 1372827850436 |
10 | 402113212440 |
11 | 145598475165 |
12 | 65b22a99420 |
13 | 2bbc43a3cc4 |
14 | 15668acbc92 |
15 | a6d71c0810 |
hex | 5d9fd0b018 |
402113212440 has 32 divisors (see below), whose sum is σ = 1206339637680. Its totient is φ = 107230189952.
The previous prime is 402113212439. The next prime is 402113212517. The reversal of 402113212440 is 44212311204.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 402113212440.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 1675471599 + ... + 1675471838.
Almost surely, 2402113212440 is an apocalyptic number.
402113212440 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
402113212440 is an abundant number, since it is smaller than the sum of its proper divisors (804226425240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402113212440 is a wasteful number, since it uses less digits than its factorization.
402113212440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3350943451 (or 3350943447 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 402113212440 its reverse (44212311204), we get a palindrome (446325523644).
The spelling of 402113212440 in words is "four hundred two billion, one hundred thirteen million, two hundred twelve thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •