Base | Representation |
---|---|
bin | 10100100111001011… |
… | …101001001001000010 |
3 | 2010010102122020210012 |
4 | 110213023221021002 |
5 | 330311320400002 |
6 | 14100053504522 |
7 | 1412312411303 |
oct | 244713511102 |
9 | 63112566705 |
10 | 22132200002 |
11 | 9428060490 |
12 | 4358042142 |
13 | 211935ac43 |
14 | 10dd5547aa |
15 | 898043d52 |
hex | 5272e9242 |
22132200002 has 8 divisors (see below), whose sum is σ = 36216327312. Its totient is φ = 10060090900.
The previous prime is 22132199963. The next prime is 22132200007. The reversal of 22132200002 is 20000223122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×221322000023 (a number of 32 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22132200002.
It is not an unprimeable number, because it can be changed into a prime (22132200007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 503004524 + ... + 503004567.
It is an arithmetic number, because the mean of its divisors is an integer number (4527040914).
Almost surely, 222132200002 is an apocalyptic number.
22132200002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22132200002 is a deficient number, since it is larger than the sum of its proper divisors (14084127310).
22132200002 is a wasteful number, since it uses less digits than its factorization.
22132200002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006009104.
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 22132200002 its reverse (20000223122), we get a palindrome (42132423124).
It can be divided in two parts, 221 and 32200002, that added together give a palindrome (32200223).
The spelling of 22132200002 in words is "twenty-two billion, one hundred thirty-two million, two hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •