Base | Representation |
---|---|
bin | 1011101101100110110… |
… | …00000111001011010001 |
3 | 1102110202211111101121121 |
4 | 11312303120013023101 |
5 | 23043144444313131 |
6 | 504513511522241 |
7 | 41034605316211 |
oct | 5666330071321 |
9 | 1373684441547 |
10 | 402441401041 |
11 | 145746752109 |
12 | 65bb4989381 |
13 | 2bc47391444 |
14 | 1569a51c241 |
15 | a705deb911 |
hex | 5db36072d1 |
402441401041 has 4 divisors (see below), whose sum is σ = 402460157284. Its totient is φ = 402422644800.
The previous prime is 402441400997. The next prime is 402441401053. The reversal of 402441401041 is 140104144204.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 358034689600 + 44406711441 = 598360^2 + 210729^2 .
It is a cyclic number.
It is not a de Polignac number, because 402441401041 - 27 = 402441400913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 402441400997 and 402441401015.
It is not an unprimeable number, because it can be changed into a prime (402441401071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9345900 + ... + 9388861.
It is an arithmetic number, because the mean of its divisors is an integer number (100615039321).
Almost surely, 2402441401041 is an apocalyptic number.
It is an amenable number.
402441401041 is a deficient number, since it is larger than the sum of its proper divisors (18756243).
402441401041 is a wasteful number, since it uses less digits than its factorization.
402441401041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18756242.
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 402441401041 its reverse (140104144204), we get a palindrome (542545545245).
The spelling of 402441401041 in words is "four hundred two billion, four hundred forty-one million, four hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •