Base | Representation |
---|---|
bin | 1011101010001100010… |
… | …10100011011011100000 |
3 | 1102022001010202101112220 |
4 | 11311012022203123200 |
5 | 23030421414131313 |
6 | 504012015551040 |
7 | 40641316264560 |
oct | 5650612433340 |
9 | 1368033671486 |
10 | 400609130208 |
11 | 1449964569a1 |
12 | 6578322b480 |
13 | 2ba148b2911 |
14 | 15565044da0 |
15 | a64a11b823 |
hex | 5d462a36e0 |
400609130208 has 192 divisors, whose sum is σ = 1244849098752. Its totient is φ = 110387773440.
The previous prime is 400609130161. The next prime is 400609130213. The reversal of 400609130208 is 802031906004.
It is a super-4 number, since 4×4006091302084 (a number of 48 digits) contains 4444 as substring.
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, 6070960 + ... + 6136592.
It is an arithmetic number, because the mean of its divisors is an integer number (6483589056).
Almost surely, 2400609130208 is an apocalyptic number.
400609130208 is a gapful number since it is divisible by the number (48) 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 400609130208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (622424549376).
400609130208 is an abundant number, since it is smaller than the sum of its proper divisors (844239968544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400609130208 is a wasteful number, since it uses less digits than its factorization.
400609130208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65977 (or 65969 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The spelling of 400609130208 in words is "four hundred billion, six hundred nine million, one hundred thirty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •