Base | Representation |
---|---|
bin | 100100010111001… |
… | …0110100001011110 |
3 | 10011000212000212012 |
4 | 1020232112201132 |
5 | 4444322013210 |
6 | 321023111222 |
7 | 42143524160 |
oct | 11056264136 |
9 | 3130760765 |
10 | 1220110430 |
11 | 5767a2030 |
12 | 2a0742512 |
13 | 165a15c46 |
14 | b8086930 |
15 | 721ae305 |
hex | 48b9685e |
1220110430 has 64 divisors (see below), whose sum is σ = 2748349440. Its totient is φ = 378873600.
The previous prime is 1220110429. The next prime is 1220110433. The reversal of 1220110430 is 340110221.
It is a super-2 number, since 2×12201104302 = 2977338922789569800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220110433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 213551 + ... + 219189.
It is an arithmetic number, because the mean of its divisors is an integer number (42942960).
Almost surely, 21220110430 is an apocalyptic number.
1220110430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1220110430 is an abundant number, since it is smaller than the sum of its proper divisors (1528239010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220110430 is a wasteful number, since it uses less digits than its factorization.
1220110430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5945.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1220110430 is about 34930.0791582269. The cubic root of 1220110430 is about 1068.5619689953.
Adding to 1220110430 its reverse (340110221), we get a palindrome (1560220651).
The spelling of 1220110430 in words is "one billion, two hundred twenty million, one hundred ten thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •