Base | Representation |
---|---|
bin | 101110001101100… |
… | …0010100001110001 |
3 | 11000001201020111112 |
4 | 1130123002201301 |
5 | 11133422421423 |
6 | 413510323105 |
7 | 53265546500 |
oct | 13433024161 |
9 | 4001636445 |
10 | 1550592113 |
11 | 7262a5894 |
12 | 373359495 |
13 | 1b9327035 |
14 | 109d12837 |
15 | 911dea78 |
hex | 5c6c2871 |
1550592113 has 12 divisors (see below), whose sum is σ = 1804429620. Its totient is φ = 1328578272.
The previous prime is 1550592107. The next prime is 1550592119. The reversal of 1550592113 is 3112950551.
It is an interprime number because it is at equal distance from previous prime (1550592107) and next prime (1550592119).
It can be written as a sum of positive squares in 2 ways, for example, as 582884449 + 967707664 = 24143^2 + 31108^2 .
It is not a de Polignac number, because 1550592113 - 28 = 1550591857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1550592113.
It is not an unprimeable number, because it can be changed into a prime (1550592119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 191495 + ... + 199427.
It is an arithmetic number, because the mean of its divisors is an integer number (150369135).
Almost surely, 21550592113 is an apocalyptic number.
It is an amenable number.
1550592113 is a deficient number, since it is larger than the sum of its proper divisors (253837507).
1550592113 is an equidigital number, since it uses as much as digits as its factorization.
1550592113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11936 (or 11929 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 32.
The square root of 1550592113 is about 39377.5584946553. The cubic root of 1550592113 is about 1157.4418739072.
The spelling of 1550592113 in words is "one billion, five hundred fifty million, five hundred ninety-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •