Base | Representation |
---|---|
bin | 10000000000111011010… |
… | …10101011011010101000 |
3 | 1221121022010010002202222 |
4 | 20000131222223122220 |
5 | 33003404401303112 |
6 | 1100441043013212 |
7 | 54516536632646 |
oct | 10003552533250 |
9 | 1847263102688 |
10 | 550253541032 |
11 | 1a23a7862698 |
12 | 8a78696a208 |
13 | 3cb7259cb80 |
14 | 1c8bd4b2196 |
15 | e4a78ab372 |
hex | 801daab6a8 |
550253541032 has 32 divisors (see below), whose sum is σ = 1111305583080. Its totient is φ = 253913640960.
The previous prime is 550253541007. The next prime is 550253541059. The reversal of 550253541032 is 230145352055.
It can be written as a sum of positive squares in 4 ways, for example, as 407434549636 + 142818991396 = 638306^2 + 377914^2 .
It is a junction number, because it is equal to n+sod(n) for n = 550253540983 and 550253541001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22532 + ... + 1049292.
Almost surely, 2550253541032 is an apocalyptic number.
550253541032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
550253541032 is an abundant number, since it is smaller than the sum of its proper divisors (561052042048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550253541032 is a wasteful number, since it uses less digits than its factorization.
550253541032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1031933 (or 1031929 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 35.
Adding to 550253541032 its reverse (230145352055), we get a palindrome (780398893087).
The spelling of 550253541032 in words is "five hundred fifty billion, two hundred fifty-three million, five hundred forty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •