Base | Representation |
---|---|
bin | 11000000000101… |
… | …110110101110001 |
3 | 1001002000122111201 |
4 | 120000232311301 |
5 | 1311112020131 |
6 | 103550211201 |
7 | 12661061224 |
oct | 3000566561 |
9 | 1032018451 |
10 | 402845041 |
11 | 197439495 |
12 | b2ab3b01 |
13 | 655c9561 |
14 | 3b7055bb |
15 | 25576761 |
hex | 1802ed71 |
402845041 has 3 divisors (see below), whose sum is σ = 402865113. Its totient is φ = 402824970.
The previous prime is 402845033. The next prime is 402845059. The reversal of 402845041 is 140548204.
The square root of 402845041 is 20071.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 402845041 - 23 = 402845033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (402845081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 10036 + ... + 30106.
It is an arithmetic number, because the mean of its divisors is an integer number (134288371).
Almost surely, 2402845041 is an apocalyptic number.
402845041 is the 20071-st square number.
402845041 is the 10036-th centered octagonal number.
It is an amenable number.
402845041 is a deficient number, since it is larger than the sum of its proper divisors (20072).
402845041 is an frugal number, since it uses more digits than its factorization.
402845041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40142 (or 20071 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 28.
The cubic root of 402845041 is about 738.5490445284.
The spelling of 402845041 in words is "four hundred two million, eight hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •