Base | Representation |
---|---|
bin | 1011010000000101… |
… | …0011111000000001 |
3 | 21210111010012201212 |
4 | 2310001103320001 |
5 | 22141140224213 |
6 | 1215410135505 |
7 | 134562431345 |
oct | 26401237001 |
9 | 7714105655 |
10 | 3020242433 |
11 | 130a93692a |
12 | 703581595 |
13 | 391951100 |
14 | 209195625 |
15 | 12a2419a8 |
hex | b4053e01 |
3020242433 has 6 divisors (see below), whose sum is σ = 3270440214. Its totient is φ = 2787915936.
The previous prime is 3020242411. The next prime is 3020242541. The reversal of 3020242433 is 3342420203.
It can be written as a sum of positive squares in 3 ways, for example, as 4804864 + 3015437569 = 2192^2 + 54913^2 .
It is not a de Polignac number, because 3020242433 - 26 = 3020242369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3020242399 and 3020242408.
It is not an unprimeable number, because it can be changed into a prime (3020242133) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8935460 + ... + 8935797.
It is an arithmetic number, because the mean of its divisors is an integer number (545073369).
Almost surely, 23020242433 is an apocalyptic number.
It is an amenable number.
3020242433 is a deficient number, since it is larger than the sum of its proper divisors (250197781).
3020242433 is a wasteful number, since it uses less digits than its factorization.
3020242433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17871283 (or 17871270 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 23.
The square root of 3020242433 is about 54956.7323719306. The cubic root of 3020242433 is about 1445.4861505236.
Adding to 3020242433 its reverse (3342420203), we get a palindrome (6362662636).
The spelling of 3020242433 in words is "three billion, twenty million, two hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •