Base | Representation |
---|---|
bin | 100001100010110… |
… | …1000100100011001 |
3 | 2220102220212211102 |
4 | 1003011220210121 |
5 | 4301120102421 |
6 | 303404241145 |
7 | 36615006635 |
oct | 10305504431 |
9 | 2812825742 |
10 | 1125550361 |
11 | 528386711 |
12 | 274b401b5 |
13 | 14c258540 |
14 | a96addc5 |
15 | 68c3160b |
hex | 43168919 |
1125550361 has 4 divisors (see below), whose sum is σ = 1212131172. Its totient is φ = 1038969552.
The previous prime is 1125550357. The next prime is 1125550373. The reversal of 1125550361 is 1630555211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 508773136 + 616777225 = 22556^2 + 24835^2 .
It is a cyclic number.
It is not a de Polignac number, because 1125550361 - 22 = 1125550357 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1125550561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43290386 + ... + 43290411.
It is an arithmetic number, because the mean of its divisors is an integer number (303032793).
Almost surely, 21125550361 is an apocalyptic number.
It is an amenable number.
1125550361 is a deficient number, since it is larger than the sum of its proper divisors (86580811).
1125550361 is an equidigital number, since it uses as much as digits as its factorization.
1125550361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86580810.
The product of its (nonzero) digits is 4500, while the sum is 29.
The square root of 1125550361 is about 33549.2229567243. Note that the first 3 decimals coincide. The cubic root of 1125550361 is about 1040.2114834344.
It can be divided in two parts, 11255 and 50361, that added together give a palindrome (61616).
The spelling of 1125550361 in words is "one billion, one hundred twenty-five million, five hundred fifty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •