Base | Representation |
---|---|
bin | 100100000010111111111… |
… | …1100110110101110011001 |
3 | 122112121202210001000210201 |
4 | 1020011333330312232121 |
5 | 1122132242422422023 |
6 | 14311540453342201 |
7 | 1020634532523643 |
oct | 110057774665631 |
9 | 18477683030721 |
10 | 4954243951513 |
11 | 16400a061005a |
12 | 6801ba337961 |
13 | 29c24c64b56c |
14 | 131b0294d893 |
15 | 88d1073dbad |
hex | 4817ff36b99 |
4954243951513 has 2 divisors, whose sum is σ = 4954243951514. Its totient is φ = 4954243951512.
The previous prime is 4954243951507. The next prime is 4954243951523. The reversal of 4954243951513 is 3151593424594.
4954243951513 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., 4682774816784 + 271469134729 = 2163972^2 + 521027^2 .
It is a cyclic number.
It is not a de Polignac number, because 4954243951513 - 233 = 4945654016921 is a prime.
It is a super-2 number, since 2×49542439515132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4954243951523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2477121975756 + 2477121975757.
It is an arithmetic number, because the mean of its divisors is an integer number (2477121975757).
Almost surely, 24954243951513 is an apocalyptic number.
It is an amenable number.
4954243951513 is a deficient number, since it is larger than the sum of its proper divisors (1).
4954243951513 is an equidigital number, since it uses as much as digits as its factorization.
4954243951513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11664000, while the sum is 55.
The spelling of 4954243951513 in words is "four trillion, nine hundred fifty-four billion, two hundred forty-three million, nine hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •