Base | Representation |
---|---|
bin | 1011010001000001… |
… | …1111100101100001 |
3 | 21210202121102110000 |
4 | 2310100133211201 |
5 | 22143200110221 |
6 | 1220031330213 |
7 | 134641316253 |
oct | 26420374541 |
9 | 7722542400 |
10 | 3024222561 |
11 | 1312105198 |
12 | 704980969 |
13 | 392715909 |
14 | 20990dcd3 |
15 | 12a77ae26 |
hex | b441f961 |
3024222561 has 10 divisors (see below), whose sum is σ = 4517665922. Its totient is φ = 2016148320.
The previous prime is 3024222557. The next prime is 3024222601. The reversal of 3024222561 is 1652224203.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1673219025 + 1351003536 = 40905^2 + 36756^2 .
It is not a de Polignac number, because 3024222561 - 22 = 3024222557 is a prime.
It is a super-2 number, since 2×30242225612 = 18291844196922797442, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3024222511) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 18667960 + ... + 18668121.
Almost surely, 23024222561 is an apocalyptic number.
It is an amenable number.
3024222561 is a deficient number, since it is larger than the sum of its proper divisors (1493443361).
3024222561 is an equidigital number, since it uses as much as digits as its factorization.
3024222561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37336093 (or 37336084 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 3024222561 is about 54992.9319185657. The cubic root of 3024222561 is about 1446.1208340682.
Adding to 3024222561 its reverse (1652224203), we get a palindrome (4676446764).
The spelling of 3024222561 in words is "three billion, twenty-four million, two hundred twenty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •