Base | Representation |
---|---|
bin | 100110111000… |
… | …010101011101 |
3 | 201011211002200 |
4 | 212320111131 |
5 | 10102122341 |
6 | 1002242113 |
7 | 152426634 |
oct | 46702535 |
9 | 21154080 |
10 | 10192221 |
11 | 5831626 |
12 | 34b6339 |
13 | 215b200 |
14 | 14d451b |
15 | d64db6 |
hex | 9b855d |
10192221 has 18 divisors (see below), whose sum is σ = 15944058. Its totient is φ = 6271200.
The previous prime is 10192201. The next prime is 10192229. The reversal of 10192221 is 12229101.
It can be written as a sum of positive squares in 3 ways, for example, as 22500 + 10169721 = 150^2 + 3189^2 .
It is not a de Polignac number, because 10192221 - 26 = 10192157 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10192194 and 10192203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10192229) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 1830 + ... + 4871.
It is an arithmetic number, because the mean of its divisors is an integer number (885781).
Almost surely, 210192221 is an apocalyptic number.
It is an amenable number.
10192221 is a deficient number, since it is larger than the sum of its proper divisors (5751837).
10192221 is a wasteful number, since it uses less digits than its factorization.
10192221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6733 (or 6717 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 10192221 is about 3192.5258025582. The cubic root of 10192221 is about 216.8151426745.
It can be divided in two parts, 1019 and 2221, that added together give a triangular number (3240 = T80).
The spelling of 10192221 in words is "ten million, one hundred ninety-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •