Base | Representation |
---|---|
bin | 1011110101111111010… |
… | …00111101011100011000 |
3 | 1102220101111101011201000 |
4 | 11322333220331130120 |
5 | 23131404140032022 |
6 | 510540245425000 |
7 | 41254255606116 |
oct | 5727750753430 |
9 | 1386344334630 |
10 | 406942111512 |
11 | 147646238542 |
12 | 66a5010b160 |
13 | 2c4b3956431 |
14 | 159a6170ab6 |
15 | a8bb0ca6ac |
hex | 5ebfa3d718 |
406942111512 has 128 divisors (see below), whose sum is σ = 1148731761600. Its totient is φ = 133464489984.
The previous prime is 406942111507. The next prime is 406942111531. The reversal of 406942111512 is 215111249604.
406942111512 is a `hidden beast` number, since 40 + 6 + 94 + 2 + 1 + 11 + 512 = 666.
It is a super-2 number, since 2×4069421115122 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 3283048 + ... + 3404744.
Almost surely, 2406942111512 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 406942111512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (574365880800).
406942111512 is an abundant number, since it is smaller than the sum of its proper divisors (741789650088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406942111512 is a wasteful number, since it uses less digits than its factorization.
406942111512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121962 (or 121952 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 406942111512 in words is "four hundred six billion, nine hundred forty-two million, one hundred eleven thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •