Base | Representation |
---|---|
bin | 1011101010111111111… |
… | …10111110110001101111 |
3 | 1102100011022211220102210 |
4 | 11311133332332301233 |
5 | 23032313312212421 |
6 | 504123012221503 |
7 | 40655126224341 |
oct | 5653776766157 |
9 | 1370138756383 |
10 | 401042304111 |
11 | 145098a1a959 |
12 | 6588430a893 |
13 | 2ba8356aa37 |
14 | 155a67a3291 |
15 | a673184576 |
hex | 5d5ffbec6f |
401042304111 has 4 divisors (see below), whose sum is σ = 534723072152. Its totient is φ = 267361536072.
The previous prime is 401042304083. The next prime is 401042304121. The reversal of 401042304111 is 111403240104.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 401042304111 - 25 = 401042304079 is a prime.
It is a super-3 number, since 3×4010423041113 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401042304121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66840384016 + ... + 66840384021.
It is an arithmetic number, because the mean of its divisors is an integer number (133680768038).
Almost surely, 2401042304111 is an apocalyptic number.
401042304111 is a deficient number, since it is larger than the sum of its proper divisors (133680768041).
401042304111 is a wasteful number, since it uses less digits than its factorization.
401042304111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133680768040.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 401042304111 its reverse (111403240104), we get a palindrome (512445544215).
The spelling of 401042304111 in words is "four hundred one billion, forty-two million, three hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •