Base | Representation |
---|---|
bin | 1011101010000010011… |
… | …01101011101101010000 |
3 | 1102021211100110012202212 |
4 | 11311001031223231100 |
5 | 23030234133030324 |
6 | 503555451331252 |
7 | 40636260242441 |
oct | 5650115535520 |
9 | 1367740405685 |
10 | 400526064464 |
11 | 144953581419 |
12 | 6575b450b28 |
13 | 2ba0061aca6 |
14 | 15557dc12c8 |
15 | a642bae70e |
hex | 5d4136bb50 |
400526064464 has 10 divisors (see below), whose sum is σ = 776019249930. Its totient is φ = 200263032224.
The previous prime is 400526064383. The next prime is 400526064469. The reversal of 400526064464 is 464460625004.
It can be written as a sum of positive squares in only one way, i.e., 203382960400 + 197143104064 = 450980^2 + 444008^2 .
It is a super-2 number, since 2×4005260644642 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400526064469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12516439499 + ... + 12516439530.
It is an arithmetic number, because the mean of its divisors is an integer number (77601924993).
Almost surely, 2400526064464 is an apocalyptic number.
It is an amenable number.
400526064464 is a deficient number, since it is larger than the sum of its proper divisors (375493185466).
400526064464 is a wasteful number, since it uses less digits than its factorization.
400526064464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25032879037 (or 25032879031 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 41.
Adding to 400526064464 its reverse (464460625004), we get a palindrome (864986689468).
The spelling of 400526064464 in words is "four hundred billion, five hundred twenty-six million, sixty-four thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •