Base | Representation |
---|---|
bin | 100100010111000… |
… | …0011111111110111 |
3 | 10011000201011202212 |
4 | 1020232003333313 |
5 | 4444312101201 |
6 | 321021324035 |
7 | 42143060021 |
oct | 11056037767 |
9 | 3130634685 |
10 | 1220034551 |
11 | 57675001a |
12 | 2a070661b |
13 | 1659ba548 |
14 | b8067011 |
15 | 72196abb |
hex | 48b83ff7 |
1220034551 has 4 divisors (see below), whose sum is σ = 1220362704. Its totient is φ = 1219706400.
The previous prime is 1220034547. The next prime is 1220034577. The reversal of 1220034551 is 1554300221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1220034551 - 22 = 1220034547 is a prime.
It is a super-3 number, since 3×12200345513 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220034451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158435 + ... + 165956.
It is an arithmetic number, because the mean of its divisors is an integer number (305090676).
Almost surely, 21220034551 is an apocalyptic number.
1220034551 is a deficient number, since it is larger than the sum of its proper divisors (328153).
1220034551 is an equidigital number, since it uses as much as digits as its factorization.
1220034551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328152.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1220034551 is about 34928.9929857704. The cubic root of 1220034551 is about 1068.5398171495.
Adding to 1220034551 its reverse (1554300221), we get a palindrome (2774334772).
The spelling of 1220034551 in words is "one billion, two hundred twenty million, thirty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •