Base | Representation |
---|---|
bin | 110010011010000… |
… | …1010110100110111 |
3 | 11100212122220002022 |
4 | 1210310022310313 |
5 | 11430444204211 |
6 | 435500303355 |
7 | 56625432563 |
oct | 14464126467 |
9 | 4325586068 |
10 | 1691397431 |
11 | 798827a19 |
12 | 3b2541b5b |
13 | 20c556aa9 |
14 | 1208c66a3 |
15 | 9d754bdb |
hex | 64d0ad37 |
1691397431 has 4 divisors (see below), whose sum is σ = 1691484312. Its totient is φ = 1691310552.
The previous prime is 1691397401. The next prime is 1691397457. The reversal of 1691397431 is 1347931961.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1347931961 = 101 ⋅13345861.
It is a cyclic number.
It is not a de Polignac number, because 1691397431 - 210 = 1691396407 is a prime.
It is a super-2 number, since 2×16913974312 = 5721650539186799522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1691397401) 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, 740 + ... + 58166.
It is an arithmetic number, because the mean of its divisors is an integer number (422871078).
Almost surely, 21691397431 is an apocalyptic number.
1691397431 is a deficient number, since it is larger than the sum of its proper divisors (86881).
1691397431 is an equidigital number, since it uses as much as digits as its factorization.
1691397431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86880.
The product of its digits is 122472, while the sum is 44.
The square root of 1691397431 is about 41126.6024733383. The cubic root of 1691397431 is about 1191.4666451531.
The spelling of 1691397431 in words is "one billion, six hundred ninety-one million, three hundred ninety-seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •