Base | Representation |
---|---|
bin | 100100000111111000001… |
… | …0011001101010111100101 |
3 | 122120121210210022011122202 |
4 | 1020033300103031113211 |
5 | 1122320221002403323 |
6 | 14320432121504245 |
7 | 1021455234313643 |
oct | 110176023152745 |
9 | 18517723264582 |
10 | 4964718794213 |
11 | 1644586369452 |
12 | 682242342085 |
13 | 2a022b823139 |
14 | 132417b9a193 |
15 | 89225145d28 |
hex | 483f04cd5e5 |
4964718794213 has 2 divisors, whose sum is σ = 4964718794214. Its totient is φ = 4964718794212.
The previous prime is 4964718794209. The next prime is 4964718794251. The reversal of 4964718794213 is 3124978174694.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3420957273889 + 1543761520324 = 1849583^2 + 1242482^2 .
It is a cyclic number.
It is not a de Polignac number, because 4964718794213 - 22 = 4964718794209 is a prime.
It is a super-2 number, since 2×49647187942132 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4964718794213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4964712794213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2482359397106 + 2482359397107.
It is an arithmetic number, because the mean of its divisors is an integer number (2482359397107).
Almost surely, 24964718794213 is an apocalyptic number.
It is an amenable number.
4964718794213 is a deficient number, since it is larger than the sum of its proper divisors (1).
4964718794213 is an equidigital number, since it uses as much as digits as its factorization.
4964718794213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 73156608, while the sum is 65.
The spelling of 4964718794213 in words is "four trillion, nine hundred sixty-four billion, seven hundred eighteen million, seven hundred ninety-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •