Base | Representation |
---|---|
bin | 10000000010011011001… |
… | …01000100000000000000 |
3 | 1221200101010200010000000 |
4 | 20001031211010000000 |
5 | 33012031142001412 |
6 | 1101052520000000 |
7 | 54545500255620 |
oct | 10011545040000 |
9 | 1850333603000 |
10 | 551057375232 |
11 | 1a277a582181 |
12 | 8a970000000 |
13 | 3cc6cc96000 |
14 | 1c958158880 |
15 | e50323e4dc |
hex | 804d944000 |
551057375232 has 960 divisors, whose sum is σ = 2046338470400. Its totient is φ = 145333813248.
The previous prime is 551057375207. The next prime is 551057375237. The reversal of 551057375232 is 232573750155.
551057375232 is a `hidden beast` number, since 5 + 5 + 1 + 0 + 573 + 75 + 2 + 3 + 2 = 666.
It is not an unprimeable number, because it can be changed into a prime (551057375237) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 42389028858 + ... + 42389028870.
Almost surely, 2551057375232 is an apocalyptic number.
551057375232 is a gapful number since it is divisible by the number (52) 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 551057375232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1023169235200).
551057375232 is an abundant number, since it is smaller than the sum of its proper divisors (1495281095168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
551057375232 is an frugal number, since it uses more digits than its factorization.
551057375232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95 (or 25 counting only the distinct ones).
The product of its (nonzero) digits is 1102500, while the sum is 45.
The spelling of 551057375232 in words is "five hundred fifty-one billion, fifty-seven million, three hundred seventy-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •