Base | Representation |
---|---|
bin | 100001011100100… |
… | …0011010111100000 |
3 | 2220012201022200101 |
4 | 1002321003113200 |
5 | 4244244033011 |
6 | 303205432144 |
7 | 36544662316 |
oct | 10271032740 |
9 | 2805638611 |
10 | 1122252256 |
11 | 526533804 |
12 | 273a0b654 |
13 | 14b6722b8 |
14 | a90920b6 |
15 | 687ce2c1 |
hex | 42e435e0 |
1122252256 has 12 divisors (see below), whose sum is σ = 2209434192. Its totient is φ = 561126112.
The previous prime is 1122252253. The next prime is 1122252277. The reversal of 1122252256 is 6522522211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122252253) 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, 17535160 + ... + 17535223.
It is an arithmetic number, because the mean of its divisors is an integer number (184119516).
Almost surely, 21122252256 is an apocalyptic number.
1122252256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1122252256 is a deficient number, since it is larger than the sum of its proper divisors (1087181936).
1122252256 is an equidigital number, since it uses as much as digits as its factorization.
1122252256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35070393 (or 35070385 counting only the distinct ones).
The product of its digits is 4800, while the sum is 28.
The square root of 1122252256 is about 33500.0336716249. The cubic root of 1122252256 is about 1039.1944748662.
Adding to 1122252256 its reverse (6522522211), we get a palindrome (7644774467).
It can be divided in two parts, 112225 and 2256, that added together give a triangular number (114481 = T478).
The spelling of 1122252256 in words is "one billion, one hundred twenty-two million, two hundred fifty-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •