Base | Representation |
---|---|
bin | 111001110110110… |
… | …101100010110001 |
3 | 2111122111110200211 |
4 | 321312311202301 |
5 | 3441443121101 |
6 | 240152544121 |
7 | 33024420232 |
oct | 7166654261 |
9 | 2448443624 |
10 | 970676401 |
11 | 458a15602 |
12 | 2310b2041 |
13 | 126141046 |
14 | 92cb7089 |
15 | 5a33cc51 |
hex | 39db58b1 |
970676401 has 4 divisors (see below), whose sum is σ = 983973412. Its totient is φ = 957379392.
The previous prime is 970676341. The next prime is 970676417. The reversal of 970676401 is 104676079.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 104676079 = 109 ⋅960331.
It can be written as a sum of positive squares in 2 ways, for example, as 567630625 + 403045776 = 23825^2 + 20076^2 .
It is a cyclic number.
It is not a de Polignac number, because 970676401 - 29 = 970675889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (970676431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6648396 + ... + 6648541.
It is an arithmetic number, because the mean of its divisors is an integer number (245993353).
Almost surely, 2970676401 is an apocalyptic number.
It is an amenable number.
970676401 is a deficient number, since it is larger than the sum of its proper divisors (13297011).
970676401 is a wasteful number, since it uses less digits than its factorization.
970676401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13297010.
The product of its (nonzero) digits is 63504, while the sum is 40.
The square root of 970676401 is about 31155.6800760311. The cubic root of 970676401 is about 990.1283379519.
The spelling of 970676401 in words is "nine hundred seventy million, six hundred seventy-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •