Base | Representation |
---|---|
bin | 110010011000010… |
… | …0000010101000011 |
3 | 11100210212002112020 |
4 | 1210300200111003 |
5 | 11430222440211 |
6 | 435423532523 |
7 | 56614322361 |
oct | 14460402503 |
9 | 4323762466 |
10 | 1690436931 |
11 | 798231317 |
12 | 3b215a143 |
13 | 20c2ab851 |
14 | 120716631 |
15 | 9d615306 |
hex | 64c20543 |
1690436931 has 4 divisors (see below), whose sum is σ = 2253915912. Its totient is φ = 1126957952.
The previous prime is 1690436903. The next prime is 1690436933. The reversal of 1690436931 is 1396340961.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1690436931 - 213 = 1690428739 is a prime.
It is a super-2 number, since 2×16904369312 = 5715154035377397522, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1690436933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 281739486 + ... + 281739491.
It is an arithmetic number, because the mean of its divisors is an integer number (563478978).
Almost surely, 21690436931 is an apocalyptic number.
1690436931 is a deficient number, since it is larger than the sum of its proper divisors (563478981).
1690436931 is an equidigital number, since it uses as much as digits as its factorization.
1690436931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563478980.
The product of its (nonzero) digits is 104976, while the sum is 42.
The square root of 1690436931 is about 41114.9234585205. The cubic root of 1690436931 is about 1191.2410682848.
It can be divided in two parts, 16904 and 36931, that added together give a palindrome (53835).
The spelling of 1690436931 in words is "one billion, six hundred ninety million, four hundred thirty-six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •