Base | Representation |
---|---|
bin | 111001111111111111… |
… | …1000010110110100000 |
3 | 102220111100221200021012 |
4 | 1303333333002312200 |
5 | 4020041233113440 |
6 | 133115204120052 |
7 | 11666362561340 |
oct | 1637777026640 |
9 | 386440850235 |
10 | 124553801120 |
11 | 48906412321 |
12 | 20180996028 |
13 | b98c77a448 |
14 | 6058058d20 |
15 | 338eb6ee65 |
hex | 1cfffc2da0 |
124553801120 has 48 divisors (see below), whose sum is σ = 336295266048. Its totient is φ = 42704160000.
The previous prime is 124553801027. The next prime is 124553801131. The reversal of 124553801120 is 21108355421.
124553801120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 55603256 + ... + 55605495.
It is an arithmetic number, because the mean of its divisors is an integer number (7006151376).
Almost surely, 2124553801120 is an apocalyptic number.
124553801120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
124553801120 is an abundant number, since it is smaller than the sum of its proper divisors (211741464928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124553801120 is a wasteful number, since it uses less digits than its factorization.
124553801120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111208773 (or 111208765 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 32.
The spelling of 124553801120 in words is "one hundred twenty-four billion, five hundred fifty-three million, eight hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •