Base | Representation |
---|---|
bin | 10101011101011101011… |
… | …011110010011011010001 |
3 | 12012222120021000200010202 |
4 | 111131131123302123101 |
5 | 143130232241114144 |
6 | 3045253053104545 |
7 | 211355315425604 |
oct | 25353533623321 |
9 | 5188507020122 |
10 | 1474741348049 |
11 | 519486054322 |
12 | 1b9993a88155 |
13 | a90b542b5c8 |
14 | 51540bd433b |
15 | 28564b3464e |
hex | 1575d6f26d1 |
1474741348049 has 2 divisors, whose sum is σ = 1474741348050. Its totient is φ = 1474741348048.
The previous prime is 1474741348021. The next prime is 1474741348109. The reversal of 1474741348049 is 9408431474741.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1362075726400 + 112665621649 = 1167080^2 + 335657^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1474741348049 is a prime.
It is a super-2 number, since 2×14747413480492 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1474741347985 and 1474741348003.
It is not a weakly prime, because it can be changed into another prime (1474741368049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 737370674024 + 737370674025.
It is an arithmetic number, because the mean of its divisors is an integer number (737370674025).
Almost surely, 21474741348049 is an apocalyptic number.
It is an amenable number.
1474741348049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1474741348049 is an equidigital number, since it uses as much as digits as its factorization.
1474741348049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10838016, while the sum is 56.
The spelling of 1474741348049 in words is "one trillion, four hundred seventy-four billion, seven hundred forty-one million, three hundred forty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •