Base | Representation |
---|---|
bin | 110011110000010101111… |
… | …0001000101100100011011 |
3 | 221012000102010222102021221 |
4 | 1213200223301011210123 |
5 | 1413020313213132311 |
6 | 23043431541112511 |
7 | 1332624505332541 |
oct | 147405361054433 |
9 | 27160363872257 |
10 | 7113200130331 |
11 | 22a276703a769 |
12 | 96a7043b8737 |
13 | 3c7a05b0b479 |
14 | 1a83d0439d91 |
15 | c506d71d671 |
hex | 6782bc4591b |
7113200130331 has 2 divisors, whose sum is σ = 7113200130332. Its totient is φ = 7113200130330.
The previous prime is 7113200130301. The next prime is 7113200130403. The reversal of 7113200130331 is 1330310023117.
It is a weak prime.
It is an emirp because it is prime and its reverse (1330310023117) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7113200130331 - 217 = 7113199999259 is a prime.
It is a super-2 number, since 2×71132001303312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7113200130296 and 7113200130305.
It is not a weakly prime, because it can be changed into another prime (7113200130301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3556600065165 + 3556600065166.
It is an arithmetic number, because the mean of its divisors is an integer number (3556600065166).
Almost surely, 27113200130331 is an apocalyptic number.
7113200130331 is a deficient number, since it is larger than the sum of its proper divisors (1).
7113200130331 is an equidigital number, since it uses as much as digits as its factorization.
7113200130331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 7113200130331 its reverse (1330310023117), we get a palindrome (8443510153448).
The spelling of 7113200130331 in words is "seven trillion, one hundred thirteen billion, two hundred million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •