Base | Representation |
---|---|
bin | 1100000000010111… |
… | …1111111101000110 |
3 | 22022121021002221110 |
4 | 3000011333331012 |
5 | 23100014020100 |
6 | 1251443425450 |
7 | 142602221655 |
oct | 30005777506 |
9 | 8277232843 |
10 | 3222798150 |
11 | 1404204a50 |
12 | 75b385286 |
13 | 3c48c1770 |
14 | 22804119c |
15 | 13ce03250 |
hex | c017ff46 |
3222798150 has 96 divisors (see below), whose sum is σ = 9389899008. Its totient is φ = 721180800.
The previous prime is 3222798149. The next prime is 3222798181. The reversal of 3222798150 is 518972223.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3222798099 and 3222798108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53674 + ... + 96573.
It is an arithmetic number, because the mean of its divisors is an integer number (97811448).
Almost surely, 23222798150 is an apocalyptic number.
3222798150 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3222798150 is an abundant number, since it is smaller than the sum of its proper divisors (6167100858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3222798150 is a wasteful number, since it uses less digits than its factorization.
3222798150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150286 (or 150281 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
The square root of 3222798150 is about 56769.6939396365. The cubic root of 3222798150 is about 1477.1038673938.
The spelling of 3222798150 in words is "three billion, two hundred twenty-two million, seven hundred ninety-eight thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •