Base | Representation |
---|---|
bin | 111011100001101… |
… | …0011111101110001 |
3 | 12011012101020120222 |
4 | 1313003103331301 |
5 | 13042310410123 |
6 | 530110142425 |
7 | 100332152666 |
oct | 16703237561 |
9 | 5135336528 |
10 | 1997356913 |
11 | 9355018a2 |
12 | 478ab1a15 |
13 | 25aa602c6 |
14 | 14d3aba6d |
15 | ba53e6c8 |
hex | 770d3f71 |
1997356913 has 4 divisors (see below), whose sum is σ = 2031210480. Its totient is φ = 1963503348.
The previous prime is 1997356897. The next prime is 1997356927. The reversal of 1997356913 is 3196537991.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1997356913 - 24 = 1997356897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1997356213) 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 3 ways as a sum of consecutive naturals, for example, 16926695 + ... + 16926812.
It is an arithmetic number, because the mean of its divisors is an integer number (507802620).
Almost surely, 21997356913 is an apocalyptic number.
It is an amenable number.
1997356913 is a deficient number, since it is larger than the sum of its proper divisors (33853567).
1997356913 is an equidigital number, since it uses as much as digits as its factorization.
1997356913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33853566.
The product of its digits is 1377810, while the sum is 53.
The square root of 1997356913 is about 44691.7991694226. The cubic root of 1997356913 is about 1259.3657917324.
The spelling of 1997356913 in words is "one billion, nine hundred ninety-seven million, three hundred fifty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •