Base | Representation |
---|---|
bin | 1011101011100011110… |
… | …11010001000000111000 |
3 | 1102100221022021002202212 |
4 | 11311301323101000320 |
5 | 23033422342220440 |
6 | 504212524114252 |
7 | 40665442635131 |
oct | 5656173210070 |
9 | 1370838232685 |
10 | 401343320120 |
11 | 145232928716 |
12 | 65949095988 |
13 | 2bb00a33112 |
14 | 155d475cc88 |
15 | a68e7e4465 |
hex | 5d71ed1038 |
401343320120 has 64 divisors (see below), whose sum is σ = 931038036480. Its totient is φ = 155590557696.
The previous prime is 401343320111. The next prime is 401343320137. The reversal of 401343320120 is 21023343104.
It is a super-2 number, since 2×4013433201202 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
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, 147224 + ... + 907943.
It is an arithmetic number, because the mean of its divisors is an integer number (14547469320).
Almost surely, 2401343320120 is an apocalyptic number.
401343320120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
401343320120 is an abundant number, since it is smaller than the sum of its proper divisors (529694716360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401343320120 is a wasteful number, since it uses less digits than its factorization.
401343320120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1055472 (or 1055468 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 401343320120 its reverse (21023343104), we get a palindrome (422366663224).
The spelling of 401343320120 in words is "four hundred one billion, three hundred forty-three million, three hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •