Base | Representation |
---|---|
bin | 100100011000110… |
… | …1110101101101011 |
3 | 10011002112000120010 |
4 | 1020301232231223 |
5 | 10000033332242 |
6 | 321054103003 |
7 | 42154202643 |
oct | 11061565553 |
9 | 3132460503 |
10 | 1220995947 |
11 | 577247366 |
12 | 2a0aaaa63 |
13 | 165c66012 |
14 | b8237523 |
15 | 722d689c |
hex | 48c6eb6b |
1220995947 has 16 divisors (see below), whose sum is σ = 1752021792. Its totient is φ = 753553920.
The previous prime is 1220995943. The next prime is 1220995987. The reversal of 1220995947 is 7495990221.
It is not a de Polignac number, because 1220995947 - 22 = 1220995943 is a prime.
It is a super-2 number, since 2×12209959472 = 2981662205180853618, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1220995896 and 1220995905.
It is not an unprimeable number, because it can be changed into a prime (1220995943) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 193128 + ... + 199349.
It is an arithmetic number, because the mean of its divisors is an integer number (109501362).
Almost surely, 21220995947 is an apocalyptic number.
1220995947 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1220995947 is a deficient number, since it is larger than the sum of its proper divisors (531025845).
1220995947 is a wasteful number, since it uses less digits than its factorization.
1220995947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392558.
The product of its (nonzero) digits is 408240, while the sum is 48.
The square root of 1220995947 is about 34942.7524245014. The cubic root of 1220995947 is about 1068.8204158112.
The spelling of 1220995947 in words is "one billion, two hundred twenty million, nine hundred ninety-five thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •