Base | Representation |
---|---|
bin | 110010011001011… |
… | …0110010110000101 |
3 | 11100212000022102020 |
4 | 1210302312112011 |
5 | 11430402121042 |
6 | 435445033353 |
7 | 56622462000 |
oct | 14462662605 |
9 | 4325008366 |
10 | 1691051397 |
11 | 798610a42 |
12 | 3b23b5859 |
13 | 20c465439 |
14 | 120836537 |
15 | 9d6d73ec |
hex | 64cb6585 |
1691051397 has 32 divisors (see below), whose sum is σ = 2653728000. Its totient is φ = 957386304.
The previous prime is 1691051389. The next prime is 1691051407. The reversal of 1691051397 is 7931501961.
It is not a de Polignac number, because 1691051397 - 23 = 1691051389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1691051317) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 104623 + ... + 119699.
It is an arithmetic number, because the mean of its divisors is an integer number (82929000).
Almost surely, 21691051397 is an apocalyptic number.
It is an amenable number.
1691051397 is a deficient number, since it is larger than the sum of its proper divisors (962676603).
1691051397 is a wasteful number, since it uses less digits than its factorization.
1691051397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15210 (or 15196 counting only the distinct ones).
The product of its (nonzero) digits is 51030, while the sum is 42.
The square root of 1691051397 is about 41122.3953217708. The cubic root of 1691051397 is about 1191.3853876712.
The spelling of 1691051397 in words is "one billion, six hundred ninety-one million, fifty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •