Base | Representation |
---|---|
bin | 11000100110000001011… |
… | …101110011001110100001 |
3 | 12222120102120110001220101 |
4 | 120212001131303032201 |
5 | 210142303110021233 |
6 | 3332230224342401 |
7 | 233051052561031 |
oct | 30460135631641 |
9 | 5876376401811 |
10 | 1690094220193 |
11 | 5a1846143605 |
12 | 233675174a01 |
13 | c34b54170c2 |
14 | 5bb2dd138c1 |
15 | 2de6ad72c7d |
hex | 189817733a1 |
1690094220193 has 8 divisors (see below), whose sum is σ = 1690806062312. Its totient is φ = 1689382521216.
The previous prime is 1690094220181. The next prime is 1690094220233. The reversal of 1690094220193 is 3910224900961.
It can be written as a sum of positive squares in 4 ways, for example, as 148404464289 + 1541689755904 = 385233^2 + 1241648^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1690094220193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1690094224193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28036621 + ... + 28096837.
It is an arithmetic number, because the mean of its divisors is an integer number (211350757789).
Almost surely, 21690094220193 is an apocalyptic number.
It is an amenable number.
1690094220193 is a deficient number, since it is larger than the sum of its proper divisors (711842119).
1690094220193 is an equidigital number, since it uses as much as digits as its factorization.
1690094220193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71571.
The product of its (nonzero) digits is 209952, while the sum is 46.
The spelling of 1690094220193 in words is "one trillion, six hundred ninety billion, ninety-four million, two hundred twenty thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •