Base | Representation |
---|---|
bin | 100010001001111001001… |
… | …100111100001111001101 |
3 | 22022101020102121010121102 |
4 | 202021321030330033031 |
5 | 301423312402013323 |
6 | 4554123005312445 |
7 | 331366653151514 |
oct | 42117114741715 |
9 | 8271212533542 |
10 | 2347085579213 |
11 | 825436691711 |
12 | 31aa6a265725 |
13 | 1404383b314b |
14 | 8185723567b |
15 | 410be244328 |
hex | 2227933c3cd |
2347085579213 has 2 divisors, whose sum is σ = 2347085579214. Its totient is φ = 2347085579212.
The previous prime is 2347085579207. The next prime is 2347085579233. The reversal of 2347085579213 is 3129755807432.
2347085579213 is digitally balanced in base 2, 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., 1324566206404 + 1022519372809 = 1150898^2 + 1011197^2 .
It is a cyclic number.
It is not a de Polignac number, because 2347085579213 - 218 = 2347085317069 is a prime.
It is a super-2 number, since 2×23470855792132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2347085579203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1173542789606 + 1173542789607.
It is an arithmetic number, because the mean of its divisors is an integer number (1173542789607).
Almost surely, 22347085579213 is an apocalyptic number.
It is an amenable number.
2347085579213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2347085579213 is an equidigital number, since it uses as much as digits as its factorization.
2347085579213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12700800, while the sum is 56.
The spelling of 2347085579213 in words is "two trillion, three hundred forty-seven billion, eighty-five million, five hundred seventy-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •