Base | Representation |
---|---|
bin | 110011010010110010… |
… | …0100010100001000000 |
3 | 101112022200102110100222 |
4 | 1212211210202201000 |
5 | 3301042403022400 |
6 | 122334135402212 |
7 | 10646445364544 |
oct | 1464544424100 |
9 | 345280373328 |
10 | 110152001600 |
11 | 42795a2a173 |
12 | 19421823368 |
13 | a505b49b94 |
14 | 548d46da24 |
15 | 2cea620185 |
hex | 19a5922840 |
110152001600 has 42 divisors (see below), whose sum is σ = 271042772874. Its totient is φ = 44060800000.
The previous prime is 110152001593. The next prime is 110152001629. The reversal of 110152001600 is 6100251011.
110152001600 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 8610355264 + 101541646336 = 92792^2 + 318656^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 34420901 + ... + 34424100.
Almost surely, 2110152001600 is an apocalyptic number.
110152001600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110152001600 is an abundant number, since it is smaller than the sum of its proper divisors (160890771274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110152001600 is an equidigital number, since it uses as much as digits as its factorization.
110152001600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68845023 (or 68845008 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 110152001600 its reverse (6100251011), we get a palindrome (116252252611).
The spelling of 110152001600 in words is "one hundred ten billion, one hundred fifty-two million, one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •