Base | Representation |
---|---|
bin | 1100110010000… |
… | …00110010000000 |
3 | 21110202100022200 |
4 | 12121000302000 |
5 | 204422020341 |
6 | 14350033200 |
7 | 2441233014 |
oct | 631006200 |
9 | 243670280 |
10 | 107220096 |
11 | 55583055 |
12 | 2baa8800 |
13 | 192a0c59 |
14 | 10350544 |
15 | 962ddb6 |
hex | 6640c80 |
107220096 has 96 divisors (see below), whose sum is σ = 310973520. Its totient is φ = 35458560.
The previous prime is 107220079. The next prime is 107220107. The reversal of 107220096 is 690022701.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1072200962 = 22992297972498432, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 187491 + ... + 188061.
Almost surely, 2107220096 is an apocalyptic number.
107220096 is a gapful number since it is divisible by the number (16) 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 107220096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155486760).
107220096 is an abundant number, since it is smaller than the sum of its proper divisors (203753424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107220096 is a wasteful number, since it uses less digits than its factorization.
107220096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 754 (or 739 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 107220096 is about 10354.7137092244. The cubic root of 107220096 is about 475.0712299459.
Adding to 107220096 its reverse (690022701), we get a palindrome (797242797).
The spelling of 107220096 in words is "one hundred seven million, two hundred twenty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •