Base | Representation |
---|---|
bin | 1100110111011… |
… | …10011001010011 |
3 | 21112002110210120 |
4 | 12123232121103 |
5 | 210112244334 |
6 | 14413201323 |
7 | 2450254164 |
oct | 633563123 |
9 | 245073716 |
10 | 107931219 |
11 | 55a19360 |
12 | 30190243 |
13 | 1948c836 |
14 | 1049776b |
15 | 971e949 |
hex | 66ee653 |
107931219 has 8 divisors (see below), whose sum is σ = 156990912. Its totient is φ = 65412840.
The previous prime is 107931217. The next prime is 107931233. The reversal of 107931219 is 912139701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107931219 - 21 = 107931217 is a prime.
It is a super-2 number, since 2×1079312192 = 23298296069651922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3270643 = 107931219 / (1 + 0 + 7 + 9 + 3 + 1 + 2 + 1 + 9).
It is a self number, because there is not a number n which added to its sum of digits gives 107931219.
It is not an unprimeable number, because it can be changed into a prime (107931211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1635289 + ... + 1635354.
It is an arithmetic number, because the mean of its divisors is an integer number (19623864).
Almost surely, 2107931219 is an apocalyptic number.
107931219 is a deficient number, since it is larger than the sum of its proper divisors (49059693).
107931219 is a wasteful number, since it uses less digits than its factorization.
107931219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3270657.
The product of its (nonzero) digits is 3402, while the sum is 33.
The square root of 107931219 is about 10388.9950909604. The cubic root of 107931219 is about 476.1191987218.
The spelling of 107931219 in words is "one hundred seven million, nine hundred thirty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •