Base | Representation |
---|---|
bin | 110011110110010111… |
… | …111001111101011000 |
3 | 12022200221200221211100 |
4 | 303312113321331120 |
5 | 1403004301210100 |
6 | 41324215031400 |
7 | 4010426165454 |
oct | 636627717530 |
9 | 168627627740 |
10 | 55673069400 |
11 | 21679aa6063 |
12 | a95896b560 |
13 | 533319bb20 |
14 | 29a1d59664 |
15 | 16ac94e400 |
hex | cf65f9f58 |
55673069400 has 144 divisors (see below), whose sum is σ = 201351018960. Its totient is φ = 13704134400.
The previous prime is 55673069357. The next prime is 55673069401. The reversal of 55673069400 is 496037655.
55673069400 is a `hidden beast` number, since 556 + 7 + 3 + 0 + 6 + 94 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55673069401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1166196 + ... + 1212995.
It is an arithmetic number, because the mean of its divisors is an integer number (1398270965).
Almost surely, 255673069400 is an apocalyptic number.
55673069400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55673069400 is an abundant number, since it is smaller than the sum of its proper divisors (145677949560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55673069400 is a wasteful number, since it uses less digits than its factorization.
55673069400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2379226 (or 2379214 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 45.
The spelling of 55673069400 in words is "fifty-five billion, six hundred seventy-three million, sixty-nine thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •