Base | Representation |
---|---|
bin | 110011010000001100… |
… | …0100000011010110000 |
3 | 101112002121122100101110 |
4 | 1212200120200122300 |
5 | 3300403112224300 |
6 | 122321350033320 |
7 | 10644340506465 |
oct | 1464030403260 |
9 | 345077570343 |
10 | 110064961200 |
11 | 4275088a457 |
12 | 193b8648840 |
13 | a4c0ac309c |
14 | 5481a9366c |
15 | 2ce2b7a550 |
hex | 19a06206b0 |
110064961200 has 60 divisors (see below), whose sum is σ = 352574762888. Its totient is φ = 29350656000.
The previous prime is 110064961187. The next prime is 110064961207. The reversal of 110064961200 is 2169460011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×1100649612002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (110064961207) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 45859201 + ... + 45861600.
Almost surely, 2110064961200 is an apocalyptic number.
110064961200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110064961200 is an abundant number, since it is smaller than the sum of its proper divisors (242509801688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110064961200 is a wasteful number, since it uses less digits than its factorization.
110064961200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91720822 (or 91720811 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 110064961200 in words is "one hundred ten billion, sixty-four million, nine hundred sixty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •