Base | Representation |
---|---|
bin | 10001011110101000000… |
… | …110011101110000001000 |
3 | 11020211021211221000210021 |
4 | 101132220012131300020 |
5 | 124134341213030400 |
6 | 2315441331230224 |
7 | 152530530521053 |
oct | 21365006356010 |
9 | 4224254830707 |
10 | 1201116142600 |
11 | 4234328275a0 |
12 | 17494b448374 |
13 | 893598cb10a |
14 | 421c4869a9a |
15 | 2139cbae71a |
hex | 117a819dc08 |
1201116142600 has 48 divisors (see below), whose sum is σ = 3046467312720. Its totient is φ = 436769505600.
The previous prime is 1201116142571. The next prime is 1201116142601. The reversal of 1201116142600 is 62416111021.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1201116142601) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 272978742 + ... + 272983141.
It is an arithmetic number, because the mean of its divisors is an integer number (63468069015).
Almost surely, 21201116142600 is an apocalyptic number.
1201116142600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1201116142600 is an abundant number, since it is smaller than the sum of its proper divisors (1845351170120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201116142600 is a wasteful number, since it uses less digits than its factorization.
1201116142600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545961910 (or 545961901 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 1201116142600 in words is "one trillion, two hundred one billion, one hundred sixteen million, one hundred forty-two thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •