Base | Representation |
---|---|
bin | 110011010011010001… |
… | …0010101010001000100 |
3 | 101112100210220102202100 |
4 | 1212212202111101010 |
5 | 3301111024402020 |
6 | 122335514512100 |
7 | 10650033152136 |
oct | 1464642252104 |
9 | 345323812670 |
10 | 110168200260 |
11 | 427a4093498 |
12 | 19427135630 |
13 | a5092cbca1 |
14 | 5491689056 |
15 | 2cebc6ea90 |
hex | 19a6895444 |
110168200260 has 144 divisors (see below), whose sum is σ = 339263188992. Its totient is φ = 28934112000.
The previous prime is 110168200243. The next prime is 110168200321. The reversal of 110168200260 is 62002861011.
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, 3456517 + ... + 3488243.
It is an arithmetic number, because the mean of its divisors is an integer number (2355994368).
Almost surely, 2110168200260 is an apocalyptic number.
110168200260 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 110168200260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169631594496).
110168200260 is an abundant number, since it is smaller than the sum of its proper divisors (229094988732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110168200260 is a wasteful number, since it uses less digits than its factorization.
110168200260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32034 (or 32029 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The spelling of 110168200260 in words is "one hundred ten billion, one hundred sixty-eight million, two hundred thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •