Base | Representation |
---|---|
bin | 110010010111101… |
… | …0000110011111101 |
3 | 11100210020112202012 |
4 | 1210233100303331 |
5 | 11430132024404 |
6 | 435412541005 |
7 | 56611464662 |
oct | 14457206375 |
9 | 4323215665 |
10 | 1690111229 |
11 | 798029644 |
12 | 3b2021765 |
13 | 20c1c6521 |
14 | 12066da69 |
15 | 9d59da6e |
hex | 64bd0cfd |
1690111229 has 4 divisors (see below), whose sum is σ = 1698868476. Its totient is φ = 1681353984.
The previous prime is 1690111133. The next prime is 1690111243. The reversal of 1690111229 is 9221110961.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 500551129 + 1189560100 = 22373^2 + 34490^2 .
It is a cyclic number.
It is not a de Polignac number, because 1690111229 - 220 = 1689062653 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1690111195 and 1690111204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1690111249) 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, 4378334 + ... + 4378719.
It is an arithmetic number, because the mean of its divisors is an integer number (424717119).
Almost surely, 21690111229 is an apocalyptic number.
It is an amenable number.
1690111229 is a deficient number, since it is larger than the sum of its proper divisors (8757247).
1690111229 is an equidigital number, since it uses as much as digits as its factorization.
1690111229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8757246.
The product of its (nonzero) digits is 1944, while the sum is 32.
The square root of 1690111229 is about 41110.9623944758. The cubic root of 1690111229 is about 1191.1645566026.
The spelling of 1690111229 in words is "one billion, six hundred ninety million, one hundred eleven thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •