Base | Representation |
---|---|
bin | 111010000011100… |
… | …110001000001011 |
3 | 2111212210101210201 |
4 | 322003212020023 |
5 | 3443322134011 |
6 | 240352353031 |
7 | 33065020516 |
oct | 7203461013 |
9 | 2455711721 |
10 | 974021131 |
11 | 45a89a546 |
12 | 232245777 |
13 | 126a42585 |
14 | 93507d7d |
15 | 5a79dcc1 |
hex | 3a0e620b |
974021131 has 2 divisors, whose sum is σ = 974021132. Its totient is φ = 974021130.
The previous prime is 974021129. The next prime is 974021159. The reversal of 974021131 is 131120479.
It is an a-pointer prime, because the next prime (974021159) can be obtained adding 974021131 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 974021131 - 21 = 974021129 is a prime.
It is a super-2 number, since 2×9740211312 = 1897434327269038322, which contains 22 as substring.
Together with 974021129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 974021131.
It is not a weakly prime, because it can be changed into another prime (974021101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 487010565 + 487010566.
It is an arithmetic number, because the mean of its divisors is an integer number (487010566).
Almost surely, 2974021131 is an apocalyptic number.
974021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
974021131 is an equidigital number, since it uses as much as digits as its factorization.
974021131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 974021131 is about 31209.3116072752. The cubic root of 974021131 is about 991.2642865254.
The spelling of 974021131 in words is "nine hundred seventy-four million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •