Base | Representation |
---|---|
bin | 1101001101001… |
… | …00101101110000 |
3 | 21201102221221102 |
4 | 12212210231300 |
5 | 211324301102 |
6 | 14554143532 |
7 | 2513400425 |
oct | 646445560 |
9 | 251387842 |
10 | 110775152 |
11 | 57591014 |
12 | 31121ba8 |
13 | 19c47137 |
14 | 109d7d4c |
15 | 9ad2402 |
hex | 69a4b70 |
110775152 has 20 divisors (see below), whose sum is σ = 221551296. Its totient is φ = 53600640.
The previous prime is 110775139. The next prime is 110775163. The reversal of 110775152 is 251577011.
110775152 is an admirable number.
It is a super-2 number, since 2×1107751522 = 24542268601246208, which contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 111173 + ... + 112164.
Almost surely, 2110775152 is an apocalyptic number.
It is an amenable number.
110775152 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110775152 is a wasteful number, since it uses less digits than its factorization.
110775152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223376 (or 223370 counting only the distinct ones).
The product of its (nonzero) digits is 2450, while the sum is 29.
The square root of 110775152 is about 10524.9775296672. The cubic root of 110775152 is about 480.2648307098.
The spelling of 110775152 in words is "one hundred ten million, seven hundred seventy-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •