Base | Representation |
---|---|
bin | 1100110001000… |
… | …01100010111000 |
3 | 21110111211211000 |
4 | 12120201202320 |
5 | 204403422102 |
6 | 14343205000 |
7 | 2440161006 |
oct | 630414270 |
9 | 243454730 |
10 | 107092152 |
11 | 554a5a12 |
12 | 2ba46760 |
13 | 1925794b |
14 | 10319a76 |
15 | 960601c |
hex | 66218b8 |
107092152 has 32 divisors (see below), whose sum is σ = 297478800. Its totient is φ = 35697312.
The previous prime is 107092121. The next prime is 107092201. The reversal of 107092152 is 251290701.
It is a super-2 number, since 2×1070921522 = 22937458039982208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 247683 + ... + 248114.
Almost surely, 2107092152 is an apocalyptic number.
107092152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107092152 is an abundant number, since it is smaller than the sum of its proper divisors (190386648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107092152 is a wasteful number, since it uses less digits than its factorization.
107092152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495812 (or 495802 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 107092152 is about 10348.5338091925. The cubic root of 107092152 is about 474.8821898042.
The spelling of 107092152 in words is "one hundred seven million, ninety-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •