Base | Representation |
---|---|
bin | 1011101001101001011… |
… | …11100001011000000000 |
3 | 1102021021202202001201220 |
4 | 11310310233201120000 |
5 | 23024322102044412 |
6 | 503523014555040 |
7 | 40631136631143 |
oct | 5646457413000 |
9 | 1367252661656 |
10 | 400316831232 |
11 | 14485646239a |
12 | 65701368a80 |
13 | 2b999180146 |
14 | 155382b805a |
15 | a62e62e68c |
hex | 5d34be1600 |
400316831232 has 320 divisors, whose sum is σ = 1163175552000. Its totient is φ = 121845841920.
The previous prime is 400316831171. The next prime is 400316831261. The reversal of 400316831232 is 232138613004.
It is a junction number, because it is equal to n+sod(n) for n = 400316831193 and 400316831202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 213046869 + ... + 213048747.
It is an arithmetic number, because the mean of its divisors is an integer number (3634923600).
Almost surely, 2400316831232 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 400316831232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (581587776000).
400316831232 is an abundant number, since it is smaller than the sum of its proper divisors (762858720768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400316831232 is a wasteful number, since it uses less digits than its factorization.
400316831232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2157 (or 2141 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 33.
The spelling of 400316831232 in words is "four hundred billion, three hundred sixteen million, eight hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •