Base | Representation |
---|---|
bin | 11000100101111100011… |
… | …001100011010100001001 |
3 | 12222120012122111122001110 |
4 | 120211330121203110021 |
5 | 210142114330022421 |
6 | 3332213550440533 |
7 | 233046001232100 |
oct | 30457431432411 |
9 | 5876178448043 |
10 | 1690009220361 |
11 | 5a1802167a10 |
12 | 233650803149 |
13 | c34a0926047 |
14 | 5bb22909037 |
15 | 2de63682a76 |
hex | 1897c663509 |
1690009220361 has 24 divisors (see below), whose sum is σ = 2859533229024. Its totient is φ = 877926866880.
The previous prime is 1690009220359. The next prime is 1690009220381. The reversal of 1690009220361 is 1630229000961.
It is not a de Polignac number, because 1690009220361 - 21 = 1690009220359 is a prime.
It is a super-2 number, since 2×16900092203612 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1690009220311) 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 23 ways as a sum of consecutive naturals, for example, 522573900 + ... + 522577133.
It is an arithmetic number, because the mean of its divisors is an integer number (119147217876).
Almost surely, 21690009220361 is an apocalyptic number.
1690009220361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1690009220361 is a deficient number, since it is larger than the sum of its proper divisors (1169524008663).
1690009220361 is a wasteful number, since it uses less digits than its factorization.
1690009220361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1045151061 (or 1045151054 counting only the distinct ones).
The product of its (nonzero) digits is 34992, while the sum is 39.
The spelling of 1690009220361 in words is "one trillion, six hundred ninety billion, nine million, two hundred twenty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •