Base | Representation |
---|---|
bin | 1100110100000100000… |
… | …0101100001111000000 |
3 | 210001012112000111112011 |
4 | 3031001000230033000 |
5 | 12101313303013240 |
6 | 245043404142304 |
7 | 21622061254456 |
oct | 3150100541700 |
9 | 701175014464 |
10 | 220134032320 |
11 | 853a3a16734 |
12 | 367b6537994 |
13 | 179b26c4a77 |
14 | a9240d69d6 |
15 | 5ad5d686ea |
hex | 334102c3c0 |
220134032320 has 28 divisors (see below), whose sum is σ = 524194165224. Its totient is φ = 88053612800.
The previous prime is 220134032303. The next prime is 220134032323. The reversal of 220134032320 is 23230431022.
It is a junction number, because it is equal to n+sod(n) for n = 220134032291 and 220134032300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220134032323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343959106 + ... + 343959745.
Almost surely, 2220134032320 is an apocalyptic number.
220134032320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220134032320 is an abundant number, since it is smaller than the sum of its proper divisors (304060132904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220134032320 is an equidigital number, since it uses as much as digits as its factorization.
220134032320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 687918868 (or 687918858 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 220134032320 its reverse (23230431022), we get a palindrome (243364463342).
The spelling of 220134032320 in words is "two hundred twenty billion, one hundred thirty-four million, thirty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •