Base | Representation |
---|---|
bin | 10110011000000101000011… |
… | …01111000010110100101001 |
3 | 20110020000220220101202120002 |
4 | 23030002201233002310221 |
5 | 22422142044323311311 |
6 | 252352505351312345 |
7 | 13236002023565234 |
oct | 1314024157026451 |
9 | 213200826352502 |
10 | 49205858807081 |
11 | 147510a6558919 |
12 | 562851267b6b5 |
13 | 215c128508072 |
14 | c2180d41a41b |
15 | 5a4e55db593b |
hex | 2cc0a1bc2d29 |
49205858807081 has 2 divisors, whose sum is σ = 49205858807082. Its totient is φ = 49205858807080.
The previous prime is 49205858807069. The next prime is 49205858807113. The reversal of 49205858807081 is 18070885850294.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48308282573056 + 897576234025 = 6950416^2 + 947405^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49205858807081 is a prime.
It is a super-2 number, since 2×492058588070812 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 49205858806999 and 49205858807017.
It is not a weakly prime, because it can be changed into another prime (49205858807051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24602929403540 + 24602929403541.
It is an arithmetic number, because the mean of its divisors is an integer number (24602929403541).
Almost surely, 249205858807081 is an apocalyptic number.
It is an amenable number.
49205858807081 is a deficient number, since it is larger than the sum of its proper divisors (1).
49205858807081 is an equidigital number, since it uses as much as digits as its factorization.
49205858807081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51609600, while the sum is 65.
The spelling of 49205858807081 in words is "forty-nine trillion, two hundred five billion, eight hundred fifty-eight million, eight hundred seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •