Base | Representation |
---|---|
bin | 101101001010000011… |
… | …1101011000000100001 |
3 | 100021022022021212002111 |
4 | 1122110013223000201 |
5 | 3042100411212044 |
6 | 112314400115321 |
7 | 10002054054664 |
oct | 1322407530041 |
9 | 307268255074 |
10 | 96974319649 |
11 | 38143525729 |
12 | 16964605b41 |
13 | 91b5a0643c |
14 | 499d2916db |
15 | 27c87c1b34 |
hex | 16941eb021 |
96974319649 has 3 divisors (see below), whose sum is σ = 96974631057. Its totient is φ = 96974008242.
The previous prime is 96974319619. The next prime is 96974319677. The reversal of 96974319649 is 94691347969.
It is a happy number.
The square root of 96974319649 is 311407.
It is a perfect power (a square), and thus also a powerful number.
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.
It is not a de Polignac number, because 96974319649 - 29 = 96974319137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (96974319619) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 155704 + ... + 467110.
It is an arithmetic number, because the mean of its divisors is an integer number (32324877019).
Almost surely, 296974319649 is an apocalyptic number.
96974319649 is the 311407-th square number.
96974319649 is the 155704-th centered octagonal number.
It is an amenable number.
96974319649 is a deficient number, since it is larger than the sum of its proper divisors (311408).
96974319649 is an frugal number, since it uses more digits than its factorization.
96974319649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622814 (or 311407 counting only the distinct ones).
The product of its digits is 79361856, while the sum is 67.
The spelling of 96974319649 in words is "ninety-six billion, nine hundred seventy-four million, three hundred nineteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •