Base | Representation |
---|---|
bin | 1011101011100100110… |
… | …00011010001110101000 |
3 | 1102100221211122020202212 |
4 | 11311302120122032220 |
5 | 23033431321210130 |
6 | 504213355544252 |
7 | 40665564605012 |
oct | 5656230321650 |
9 | 1370854566685 |
10 | 401350960040 |
11 | 1452371766a8 |
12 | 6594b75b088 |
13 | 2bb024a9694 |
14 | 155d578b1b2 |
15 | a690302e95 |
hex | 5d7261a3a8 |
401350960040 has 16 divisors (see below), whose sum is σ = 903039660180. Its totient is φ = 160540384000.
The previous prime is 401350960037. The next prime is 401350960133. The reversal of 401350960040 is 40069053104.
It can be written as a sum of positive squares in 2 ways, for example, as 400732045156 + 618914884 = 633034^2 + 24878^2 .
It is a super-2 number, since 2×4013509600402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401350959979 and 401350960006.
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 3 ways as a sum of consecutive naturals, for example, 5016886961 + ... + 5016887040.
Almost surely, 2401350960040 is an apocalyptic number.
401350960040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
401350960040 is an abundant number, since it is smaller than the sum of its proper divisors (501688700140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401350960040 is a wasteful number, since it uses less digits than its factorization.
401350960040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10033774012 (or 10033774008 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 401350960040 in words is "four hundred one billion, three hundred fifty million, nine hundred sixty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •