Base | Representation |
---|---|
bin | 1011101011111101011… |
… | …00110101001101000000 |
3 | 1102101111020112200101012 |
4 | 11311332230311031000 |
5 | 23034342223440000 |
6 | 504250101500052 |
7 | 41003654423336 |
oct | 5657654651500 |
9 | 1371436480335 |
10 | 401557640000 |
11 | 145332901390 |
12 | 659a8a11628 |
13 | 2bb3626230a |
14 | 15614dcbb56 |
15 | a6a352b735 |
hex | 5d7eb35340 |
401557640000 has 140 divisors (see below), whose sum is σ = 1086254762208. Its totient is φ = 146020800000.
The previous prime is 401557639963. The next prime is 401557640023. The reversal of 401557640000 is 46755104.
It is a super-2 number, since 2×4015576400002 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 16316 + ... + 896315.
Almost surely, 2401557640000 is an apocalyptic number.
401557640000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 401557640000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (543127381104).
401557640000 is an abundant number, since it is smaller than the sum of its proper divisors (684697122208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401557640000 is an equidigital number, since it uses as much as digits as its factorization.
401557640000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912674 (or 912649 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 32.
The spelling of 401557640000 in words is "four hundred one billion, five hundred fifty-seven million, six hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •