Base | Representation |
---|---|
bin | 10010000011111011100… |
… | …111011101001101000100 |
3 | 11101122200102002201001110 |
4 | 102003323213131031010 |
5 | 130313410013140300 |
6 | 2350104143325020 |
7 | 155446253656044 |
oct | 22037347351504 |
9 | 4348612081043 |
10 | 1241172005700 |
11 | 439418270390 |
12 | 180669bb0770 |
13 | 9007140c663 |
14 | 44104619724 |
15 | 2244452d550 |
hex | 120fb9dd344 |
1241172005700 has 144 divisors (see below), whose sum is σ = 3919492636416. Its totient is φ = 300744067200.
The previous prime is 1241172005687. The next prime is 1241172005753. The reversal of 1241172005700 is 75002711421.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6783619 + ... + 6964181.
It is an arithmetic number, because the mean of its divisors is an integer number (27218698864).
Almost surely, 21241172005700 is an apocalyptic number.
1241172005700 is a gapful number since it is divisible by the number (10) 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 1241172005700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1959746318208).
1241172005700 is an abundant number, since it is smaller than the sum of its proper divisors (2678320630716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1241172005700 is a wasteful number, since it uses less digits than its factorization.
1241172005700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182674 (or 182667 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 30.
The spelling of 1241172005700 in words is "one trillion, two hundred forty-one billion, one hundred seventy-two million, five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •