Base | Representation |
---|---|
bin | 1011101010000101011… |
… | …10110010101100101000 |
3 | 1102021220010100112122220 |
4 | 11311002232302230220 |
5 | 23030312142133224 |
6 | 504002201114040 |
7 | 40640016516102 |
oct | 5650256625450 |
9 | 1367803315586 |
10 | 400551521064 |
11 | 144966989332 |
12 | 65767a88920 |
13 | 2ba05991c76 |
14 | 1555b52a572 |
15 | a64503c279 |
hex | 5d42bb2b28 |
400551521064 has 64 divisors (see below), whose sum is σ = 1036754208000. Its totient is φ = 128807965440.
The previous prime is 400551521059. The next prime is 400551521081. The reversal of 400551521064 is 460125155004.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 621249 + ... + 1089519.
It is an arithmetic number, because the mean of its divisors is an integer number (16199284500).
Almost surely, 2400551521064 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 400551521064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (518377104000).
400551521064 is an abundant number, since it is smaller than the sum of its proper divisors (636202686936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400551521064 is a wasteful number, since it uses less digits than its factorization.
400551521064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469538 (or 469534 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 400551521064 its reverse (460125155004), we get a palindrome (860676676068).
The spelling of 400551521064 in words is "four hundred billion, five hundred fifty-one million, five hundred twenty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •