Base | Representation |
---|---|
bin | 1100000000110000… |
… | …1100011010010001 |
3 | 22022201022121111021 |
4 | 3000030030122101 |
5 | 23100423001113 |
6 | 1251542315441 |
7 | 142622064220 |
oct | 30014143221 |
9 | 8281277437 |
10 | 3224422033 |
11 | 1405113aa8 |
12 | 75ba28b81 |
13 | 3c503c941 |
14 | 228344cb7 |
15 | 13d12448d |
hex | c030c691 |
3224422033 has 8 divisors (see below), whose sum is σ = 3688856640. Its totient is φ = 2760938160.
The previous prime is 3224422013. The next prime is 3224422057. The reversal of 3224422033 is 3302244223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3224422033 - 25 = 3224422001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3224421989 and 3224422007.
It is not an unprimeable number, because it can be changed into a prime (3224422013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 230398 + ... + 243991.
It is an arithmetic number, because the mean of its divisors is an integer number (461107080).
Almost surely, 23224422033 is an apocalyptic number.
It is an amenable number.
3224422033 is a deficient number, since it is larger than the sum of its proper divisors (464434607).
3224422033 is an equidigital number, since it uses as much as digits as its factorization.
3224422033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475367.
The product of its (nonzero) digits is 6912, while the sum is 25.
The square root of 3224422033 is about 56783.9945142995. The cubic root of 3224422033 is about 1477.3519169654.
Adding to 3224422033 its reverse (3302244223), we get a palindrome (6526666256).
The spelling of 3224422033 in words is "three billion, two hundred twenty-four million, four hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •