Base | Representation |
---|---|
bin | 1011110100011101011… |
… | …01001111100011100000 |
3 | 1102211021021121001011120 |
4 | 11322032231033203200 |
5 | 23123214003310223 |
6 | 510323001412240 |
7 | 41225026552251 |
oct | 5721655174340 |
9 | 1384237531146 |
10 | 406121150688 |
11 | 147264890520 |
12 | 6686119a080 |
13 | 2c3b28449b6 |
14 | 1592910ab28 |
15 | a86deb2be3 |
hex | 5e8eb4f8e0 |
406121150688 has 48 divisors (see below), whose sum is σ = 1162983298176. Its totient is φ = 123067015040.
The previous prime is 406121150681. The next prime is 406121150707. The reversal of 406121150688 is 886051121604.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×4061211506882 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (406121150681) 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, 192291156 + ... + 192293267.
It is an arithmetic number, because the mean of its divisors is an integer number (24228818712).
Almost surely, 2406121150688 is an apocalyptic number.
406121150688 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
406121150688 is an abundant number, since it is smaller than the sum of its proper divisors (756862147488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406121150688 is a wasteful number, since it uses less digits than its factorization.
406121150688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384584447 (or 384584439 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 42.
The spelling of 406121150688 in words is "four hundred six billion, one hundred twenty-one million, one hundred fifty thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •