Base | Representation |
---|---|
bin | 1011101010111110111… |
… | …01001010101100001011 |
3 | 1102100010201011120011210 |
4 | 11311133131022230023 |
5 | 23032304030040021 |
6 | 504122054224203 |
7 | 40654660665441 |
oct | 5653735125413 |
9 | 1370121146153 |
10 | 401033440011 |
11 | 145093a16156 |
12 | 65881355063 |
13 | 2ba817861c9 |
14 | 155a5536b91 |
15 | a6724d2e76 |
hex | 5d5f74ab0b |
401033440011 has 16 divisors (see below), whose sum is σ = 552969141248. Its totient is φ = 258258218400.
The previous prime is 401033440009. The next prime is 401033440013. The reversal of 401033440011 is 110044330104.
It is an interprime number because it is at equal distance from previous prime (401033440009) and next prime (401033440013).
It is not a de Polignac number, because 401033440011 - 21 = 401033440009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 401033440011.
It is not an unprimeable number, because it can be changed into a prime (401033440013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3890800 + ... + 3992541.
It is an arithmetic number, because the mean of its divisors is an integer number (34560571328).
Almost surely, 2401033440011 is an apocalyptic number.
401033440011 is a deficient number, since it is larger than the sum of its proper divisors (151935701237).
401033440011 is a wasteful number, since it uses less digits than its factorization.
401033440011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7883922.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 401033440011 its reverse (110044330104), we get a palindrome (511077770115).
The spelling of 401033440011 in words is "four hundred one billion, thirty-three million, four hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •