Base | Representation |
---|---|
bin | 1101001000001100… |
… | …11111001100101101 |
3 | 200012012022011121201 |
4 | 12210012133030231 |
5 | 103413310200443 |
6 | 3123213525501 |
7 | 336442061653 |
oct | 64406371455 |
9 | 20165264551 |
10 | 7048131373 |
11 | 2a97539468 |
12 | 14484a3891 |
13 | 88428894a |
14 | 4ac0c8dd3 |
15 | 2b3b7534d |
hex | 1a419f32d |
7048131373 has 2 divisors, whose sum is σ = 7048131374. Its totient is φ = 7048131372.
The previous prime is 7048131367. The next prime is 7048131413. The reversal of 7048131373 is 3731318407.
7048131373 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6083532009 + 964599364 = 77997^2 + 31058^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7048131373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7048131313) 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 as a sum of consecutive naturals, namely, 3524065686 + 3524065687.
It is an arithmetic number, because the mean of its divisors is an integer number (3524065687).
Almost surely, 27048131373 is an apocalyptic number.
It is an amenable number.
7048131373 is a deficient number, since it is larger than the sum of its proper divisors (1).
7048131373 is an equidigital number, since it uses as much as digits as its factorization.
7048131373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 37.
The square root of 7048131373 is about 83953.1498694361. The cubic root of 7048131373 is about 1917.3055532690.
The spelling of 7048131373 in words is "seven billion, forty-eight million, one hundred thirty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •