Base | Representation |
---|---|
bin | 110011000001111010101… |
… | …0011011100101010001001 |
3 | 220211111002000121220200211 |
4 | 1212003311103130222021 |
5 | 1404402123022034423 |
6 | 22525543003201121 |
7 | 1322465056406014 |
oct | 146036523345211 |
9 | 26744060556624 |
10 | 7013502143113 |
11 | 2264456133304 |
12 | 95331b8161a1 |
13 | 3bb4a7a52a1b |
14 | 1a365355437b |
15 | c2685c8e10d |
hex | 660f54dca89 |
7013502143113 has 2 divisors, whose sum is σ = 7013502143114. Its totient is φ = 7013502143112.
The previous prime is 7013502143093. The next prime is 7013502143173. The reversal of 7013502143113 is 3113412053107.
7013502143113 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., 6339981556624 + 673520586489 = 2517932^2 + 820683^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7013502143113 is a prime.
It is a super-2 number, since 2×70135021431132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (7013502143173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3506751071556 + 3506751071557.
It is an arithmetic number, because the mean of its divisors is an integer number (3506751071557).
Almost surely, 27013502143113 is an apocalyptic number.
It is an amenable number.
7013502143113 is a deficient number, since it is larger than the sum of its proper divisors (1).
7013502143113 is an equidigital number, since it uses as much as digits as its factorization.
7013502143113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 31.
The spelling of 7013502143113 in words is "seven trillion, thirteen billion, five hundred two million, one hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •