Base | Representation |
---|---|
bin | 1011101011100001000… |
… | …10010110110110110000 |
3 | 1102100212200101222201210 |
4 | 11311300202112312300 |
5 | 23033400410410412 |
6 | 504210332400120 |
7 | 40665040554045 |
oct | 5656042266660 |
9 | 1370780358653 |
10 | 401320013232 |
11 | 145220759926 |
12 | 65941316040 |
13 | 2bac8c62768 |
14 | 155d16131cc |
15 | a68c73d83c |
hex | 5d70896db0 |
401320013232 has 40 divisors (see below), whose sum is σ = 1043609236480. Its totient is φ = 132887419200.
The previous prime is 401320013207. The next prime is 401320013243. The reversal of 401320013232 is 232310023104.
It is a super-4 number, since 4×4013200132324 (a number of 48 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 401320013199 and 401320013208.
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 7 ways as a sum of consecutive naturals, for example, 27677632 + ... + 27692127.
It is an arithmetic number, because the mean of its divisors is an integer number (26090230912).
Almost surely, 2401320013232 is an apocalyptic number.
It is an amenable number.
401320013232 is an abundant number, since it is smaller than the sum of its proper divisors (642289223248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401320013232 is a wasteful number, since it uses less digits than its factorization.
401320013232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55369921 (or 55369915 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 401320013232 its reverse (232310023104), we get a palindrome (633630036336).
The spelling of 401320013232 in words is "four hundred one billion, three hundred twenty million, thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •