Base | Representation |
---|---|
bin | 1011101001011111000… |
… | …01111111011001000000 |
3 | 1102021001200020000000000 |
4 | 11310233201333121000 |
5 | 23024132211214310 |
6 | 503510213000000 |
7 | 40626025516041 |
oct | 5645741773100 |
9 | 1367050200000 |
10 | 400229398080 |
11 | 144811074596 |
12 | 65698023000 |
13 | 2b984019655 |
14 | 1552a8388c8 |
15 | a626b0d4c0 |
hex | 5d2f87f640 |
400229398080 has 616 divisors, whose sum is σ = 1457840721600. Its totient is φ = 104626639872.
The previous prime is 400229398069. The next prime is 400229398099. The reversal of 400229398080 is 80893922004.
400229398080 is a `hidden beast` number, since 400 + 2 + 2 + 93 + 9 + 80 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 87 ways as a sum of consecutive naturals, for example, 1114844941 + ... + 1114845299.
Almost surely, 2400229398080 is an apocalyptic number.
400229398080 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 400229398080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (728920360800).
400229398080 is an abundant number, since it is smaller than the sum of its proper divisors (1057611323520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400229398080 is an frugal number, since it uses more digits than its factorization.
400229398080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465 (or 428 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 45.
The spelling of 400229398080 in words is "four hundred billion, two hundred twenty-nine million, three hundred ninety-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •