Base | Representation |
---|---|
bin | 110010011111001111… |
… | …001000101001110100 |
3 | 12011221001211212211222 |
4 | 302133033020221310 |
5 | 1342011023340000 |
6 | 40523153045512 |
7 | 3626255123201 |
oct | 623717105164 |
9 | 164831755758 |
10 | 54211152500 |
11 | 20a9986727a |
12 | a60b256898 |
13 | 515c351a3b |
14 | 28a3b2aca8 |
15 | 1624428a85 |
hex | c9f3c8a74 |
54211152500 has 30 divisors (see below), whose sum is σ = 118548953754. Its totient is φ = 21684460000.
The previous prime is 54211152439. The next prime is 54211152521. The reversal of 54211152500 is 525111245.
It can be written as a sum of positive squares in 5 ways, for example, as 9479748496 + 44731404004 = 97364^2 + 211498^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 54211152500.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10839731 + ... + 10844730.
Almost surely, 254211152500 is an apocalyptic number.
54211152500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
54211152500 is an abundant number, since it is smaller than the sum of its proper divisors (64337801254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54211152500 is a wasteful number, since it uses less digits than its factorization.
54211152500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21684485 (or 21684468 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 54211152500 its reverse (525111245), we get a palindrome (54736263745).
The spelling of 54211152500 in words is "fifty-four billion, two hundred eleven million, one hundred fifty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •