Base | Representation |
---|---|
bin | 1011101100000100111… |
… | …10110010110000000000 |
3 | 1102101122122220012100000 |
4 | 11312002132302300000 |
5 | 23040004443200200 |
6 | 504300245200000 |
7 | 41005354521060 |
oct | 5660236626000 |
9 | 1371578805300 |
10 | 401621068800 |
11 | 145365694386 |
12 | 65a06100000 |
13 | 2bb4643cb53 |
14 | 1561d5bd3a0 |
15 | a6a8daa300 |
hex | 5d827b2c00 |
401621068800 has 1584 divisors, whose sum is σ = 1782822892032. Its totient is φ = 87588864000.
The previous prime is 401621068799. The next prime is 401621068811. The reversal of 401621068800 is 8860126104.
It is a super-3 number, since 3×4016210688003 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1001548600 + ... + 1001549000.
Almost surely, 2401621068800 is an apocalyptic number.
401621068800 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 401621068800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (891411446016).
401621068800 is an abundant number, since it is smaller than the sum of its proper divisors (1381201823232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401621068800 is a wasteful number, since it uses less digits than its factorization.
401621068800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 476 (or 441 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The spelling of 401621068800 in words is "four hundred one billion, six hundred twenty-one million, sixty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •