Base | Representation |
---|---|
bin | 10000000001101100100… |
… | …00101000111001111000 |
3 | 1221122100212111120120020 |
4 | 20000312100220321320 |
5 | 33010231013123100 |
6 | 1100550022330440 |
7 | 54533010002100 |
oct | 10006620507170 |
9 | 1848325446506 |
10 | 550666145400 |
11 | 1a2599757438 |
12 | 8a880b89a20 |
13 | 3cc09c05577 |
14 | 1c91c1d8200 |
15 | e4cdc0e5a0 |
hex | 8036428e78 |
550666145400 has 288 divisors, whose sum is σ = 2102581430640. Its totient is φ = 118462525440.
The previous prime is 550666145317. The next prime is 550666145401. The reversal of 550666145400 is 4541666055.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550666145401) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 51087 + ... + 1050686.
Almost surely, 2550666145400 is an apocalyptic number.
550666145400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 550666145400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1051290715320).
550666145400 is an abundant number, since it is smaller than the sum of its proper divisors (1551915285240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550666145400 is a wasteful number, since it uses less digits than its factorization.
550666145400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101823 (or 1101807 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 550666145400 in words is "five hundred fifty billion, six hundred sixty-six million, one hundred forty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •