Base | Representation |
---|---|
bin | 100110110111… |
… | …110100100111 |
3 | 201011201012211 |
4 | 212313310213 |
5 | 10102040434 |
6 | 1002224251 |
7 | 152420542 |
oct | 46676447 |
9 | 21151184 |
10 | 10190119 |
11 | 582aa95 |
12 | 34b5087 |
13 | 215a274 |
14 | 14d3859 |
15 | d64464 |
hex | 9b7d27 |
10190119 has 4 divisors (see below), whose sum is σ = 10246600. Its totient is φ = 10133640.
The previous prime is 10190113. The next prime is 10190129. The reversal of 10190119 is 91109101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 91109101 = 191 ⋅477011.
It is a cyclic number.
It is not a de Polignac number, because 10190119 - 25 = 10190087 is a prime.
It is a super-2 number, since 2×101901192 = 207677050468322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10190119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10190113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27969 + ... + 28330.
It is an arithmetic number, because the mean of its divisors is an integer number (2561650).
Almost surely, 210190119 is an apocalyptic number.
10190119 is a deficient number, since it is larger than the sum of its proper divisors (56481).
10190119 is an equidigital number, since it uses as much as digits as its factorization.
10190119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56480.
The product of its (nonzero) digits is 81, while the sum is 22.
The square root of 10190119 is about 3192.1965791599. The cubic root of 10190119 is about 216.8002366409.
It can be divided in two parts, 101 and 90119, that multiplied together give a palindrome (9102019).
The spelling of 10190119 in words is "ten million, one hundred ninety thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •