Base | Representation |
---|---|
bin | 10000000001100110000… |
… | …10100100011111000011 |
3 | 1221122020002212002101012 |
4 | 20000303002210133003 |
5 | 33010123201010020 |
6 | 1100540412431135 |
7 | 54531452563055 |
oct | 10006302443703 |
9 | 1848202762335 |
10 | 550612125635 |
11 | 1a2571210600 |
12 | 8a866a784ab |
13 | 3cbcb970600 |
14 | 1c914d758d5 |
15 | e4c90dd7c5 |
hex | 80330a47c3 |
550612125635 has 72 divisors (see below), whose sum is σ = 787380279840. Its totient is φ = 369193144320.
The previous prime is 550612125611. The next prime is 550612125641. The reversal of 550612125635 is 536521216055.
It is not a de Polignac number, because 550612125635 - 28 = 550612125379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 550612125592 and 550612125601.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 98868131 + ... + 98873699.
It is an arithmetic number, because the mean of its divisors is an integer number (10935837220).
Almost surely, 2550612125635 is an apocalyptic number.
550612125635 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
550612125635 is a deficient number, since it is larger than the sum of its proper divisors (236768154205).
550612125635 is a wasteful number, since it uses less digits than its factorization.
550612125635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6589 (or 6565 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 550612125635 in words is "five hundred fifty billion, six hundred twelve million, one hundred twenty-five thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •