Base | Representation |
---|---|
bin | 11001010000001000110001… |
… | …11010000000101110100100 |
3 | 21021121121202122220211010011 |
4 | 30220010120322000232210 |
5 | 24234301020301434000 |
6 | 314034053001340004 |
7 | 14460625256204203 |
oct | 1450043072005644 |
9 | 237547678824104 |
10 | 55530050030500 |
11 | 1676a1866387a1 |
12 | 628a119497604 |
13 | 24ca5cc496336 |
14 | d9d95112323a |
15 | 6646e61c22ba |
hex | 328118e80ba4 |
55530050030500 has 48 divisors (see below), whose sum is σ = 121282542461808. Its totient is φ = 22211120160000.
The previous prime is 55530050030479. The next prime is 55530050030599. The reversal of 55530050030500 is 503005003555.
It can be written as a sum of positive squares in 8 ways, for example, as 15449679249664 + 40080370780836 = 3930608^2 + 6330906^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10173280 + ... + 14647720.
It is an arithmetic number, because the mean of its divisors is an integer number (2526719634621).
Almost surely, 255530050030500 is an apocalyptic number.
55530050030500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55530050030500 is an abundant number, since it is smaller than the sum of its proper divisors (65752492431308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55530050030500 is a wasteful number, since it uses less digits than its factorization.
55530050030500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4499281 (or 4499269 counting only the distinct ones).
The product of its (nonzero) digits is 28125, while the sum is 31.
The spelling of 55530050030500 in words is "fifty-five trillion, five hundred thirty billion, fifty million, thirty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •