Base | Representation |
---|---|
bin | 1011101001100001110… |
… | …01010111100001011100 |
3 | 1102021010021022201021010 |
4 | 11310300321113201130 |
5 | 23024204042202302 |
6 | 503512351535220 |
7 | 40626424305411 |
oct | 5646071274134 |
9 | 1367107281233 |
10 | 400252303452 |
11 | 144822a99751 |
12 | 656a382a510 |
13 | 2b9889a9321 |
14 | 1552d8bc108 |
15 | a628b3516c |
hex | 5d30e5785c |
400252303452 has 96 divisors (see below), whose sum is σ = 994649241600. Its totient is φ = 124916167872.
The previous prime is 400252303391. The next prime is 400252303469. The reversal of 400252303452 is 254303252004.
It is a super-2 number, since 2×4002523034522 (a number of 24 digits) contains 22 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, 6622273 + ... + 6682439.
It is an arithmetic number, because the mean of its divisors is an integer number (10360929600).
Almost surely, 2400252303452 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 400252303452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (497324620800).
400252303452 is an abundant number, since it is smaller than the sum of its proper divisors (594396938148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400252303452 is a wasteful number, since it uses less digits than its factorization.
400252303452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60535 (or 60533 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 30.
Adding to 400252303452 its reverse (254303252004), we get a palindrome (654555555456).
The spelling of 400252303452 in words is "four hundred billion, two hundred fifty-two million, three hundred three thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •