Base | Representation |
---|---|
bin | 110011000001010001011… |
… | …1011110101100100111101 |
3 | 220211100111201022001022212 |
4 | 1212002202323311210331 |
5 | 1404341310234101023 |
6 | 22525153515550205 |
7 | 1322415606311354 |
oct | 146024273654475 |
9 | 26740451261285 |
10 | 7012120222013 |
11 | 2263907072555 |
12 | 952bb4a5b365 |
13 | 3bb31766412a |
14 | 1a3561bca99b |
15 | c26047bae78 |
hex | 660a2ef593d |
7012120222013 has 2 divisors, whose sum is σ = 7012120222014. Its totient is φ = 7012120222012.
The previous prime is 7012120221979. The next prime is 7012120222033. The reversal of 7012120222013 is 3102220212107.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3769336824484 + 3242783397529 = 1941478^2 + 1800773^2 .
It is a cyclic number.
It is not a de Polignac number, because 7012120222013 - 216 = 7012120156477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 7012120222013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7012120222033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3506060111006 + 3506060111007.
It is an arithmetic number, because the mean of its divisors is an integer number (3506060111007).
Almost surely, 27012120222013 is an apocalyptic number.
It is an amenable number.
7012120222013 is a deficient number, since it is larger than the sum of its proper divisors (1).
7012120222013 is an equidigital number, since it uses as much as digits as its factorization.
7012120222013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
The spelling of 7012120222013 in words is "seven trillion, twelve billion, one hundred twenty million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •