Base | Representation |
---|---|
bin | 100100010111000… |
… | …0110011011000001 |
3 | 10011000201200101122 |
4 | 1020232012123001 |
5 | 4444312410411 |
6 | 321021442025 |
7 | 42143130665 |
oct | 11056063301 |
9 | 3130650348 |
10 | 1220044481 |
11 | 576757527 |
12 | 2a0710315 |
13 | 1659c1c16 |
14 | b806a8a5 |
15 | 721999db |
hex | 48b866c1 |
1220044481 has 2 divisors, whose sum is σ = 1220044482. Its totient is φ = 1220044480.
The previous prime is 1220044417. The next prime is 1220044517. The reversal of 1220044481 is 1844400221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1212432400 + 7612081 = 34820^2 + 2759^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220044481 - 26 = 1220044417 is a prime.
It is a super-2 number, since 2×12200444812 = 2977017071237118722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1220044481.
It is not a weakly prime, because it can be changed into another prime (1220044081) 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 as a sum of consecutive naturals, namely, 610022240 + 610022241.
It is an arithmetic number, because the mean of its divisors is an integer number (610022241).
Almost surely, 21220044481 is an apocalyptic number.
It is an amenable number.
1220044481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220044481 is an equidigital number, since it uses as much as digits as its factorization.
1220044481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2048, while the sum is 26.
The square root of 1220044481 is about 34929.1351310049. The cubic root of 1220044481 is about 1068.5427161307.
The spelling of 1220044481 in words is "one billion, two hundred twenty million, forty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •