Base | Representation |
---|---|
bin | 101110001100101… |
… | …0000110100000000 |
3 | 11000000211120120112 |
4 | 1130121100310000 |
5 | 11133313020321 |
6 | 413452330452 |
7 | 53261566523 |
oct | 13431206400 |
9 | 4000746515 |
10 | 1550126336 |
11 | 726007950 |
12 | 373173a28 |
13 | 1b91c3025 |
14 | 109c30bba |
15 | 9114ba5b |
hex | 5c650d00 |
1550126336 has 36 divisors (see below), whose sum is σ = 3375494304. Its totient is φ = 704601600.
The previous prime is 1550126329. The next prime is 1550126339. The reversal of 1550126336 is 6336210551.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1550126339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272420 + ... + 278051.
Almost surely, 21550126336 is an apocalyptic number.
1550126336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1550126336 is an abundant number, since it is smaller than the sum of its proper divisors (1825367968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1550126336 is an equidigital number, since it uses as much as digits as its factorization.
1550126336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550498 (or 550484 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 32.
The square root of 1550126336 is about 39371.6438061710. The cubic root of 1550126336 is about 1157.3259689811.
Adding to 1550126336 its reverse (6336210551), we get a palindrome (7886336887).
The spelling of 1550126336 in words is "one billion, five hundred fifty million, one hundred twenty-six thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •