Base | Representation |
---|---|
bin | 1011101001111110111… |
… | …01010000000100000000 |
3 | 1102021202021222210220221 |
4 | 11310333131100010000 |
5 | 23030204111403404 |
6 | 503552515512424 |
7 | 40635451566331 |
oct | 5647735200400 |
9 | 1367667883827 |
10 | 400496591104 |
11 | 144938980675 |
12 | 657515b8714 |
13 | 2b9c749b92c |
14 | 1555410c288 |
15 | a6402db954 |
hex | 5d3f750100 |
400496591104 has 81 divisors (see below), whose sum is σ = 822388180887. Its totient is φ = 194653919232.
The previous prime is 400496591041. The next prime is 400496591111. The reversal of 400496591104 is 401195694004.
The square root of 400496591104 is 632848.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 67392160000 + 333104431104 = 259600^2 + 577152^2 .
It is a Duffinian 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 8 ways as a sum of consecutive naturals, for example, 374645482 + ... + 374646550.
Almost surely, 2400496591104 is an apocalyptic number.
400496591104 is the 632848-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 400496591104
400496591104 is an abundant number, since it is smaller than the sum of its proper divisors (421891589783).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400496591104 is an frugal number, since it uses more digits than its factorization.
400496591104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228 (or 1108 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 400496591104 in words is "four hundred billion, four hundred ninety-six million, five hundred ninety-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •