Base | Representation |
---|---|
bin | 10101011101010000000… |
… | …100001100111000001101 |
3 | 12012221222121222201022221 |
4 | 111131100010030320031 |
5 | 143124302331424013 |
6 | 3045214521535341 |
7 | 211346623136104 |
oct | 25352004147015 |
9 | 5187877881287 |
10 | 1474517061133 |
11 | 519380493236 |
12 | 1b9930944551 |
13 | a907ab1c85c |
14 | 5151d0cd03b |
15 | 285500ce08d |
hex | 1575010ce0d |
1474517061133 has 2 divisors, whose sum is σ = 1474517061134. Its totient is φ = 1474517061132.
The previous prime is 1474517061091. The next prime is 1474517061137. The reversal of 1474517061133 is 3311607154741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1461398107689 + 13118953444 = 1208883^2 + 114538^2 .
It is a cyclic number.
It is not a de Polignac number, because 1474517061133 - 213 = 1474517052941 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1474517061133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1474517061137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 737258530566 + 737258530567.
It is an arithmetic number, because the mean of its divisors is an integer number (737258530567).
Almost surely, 21474517061133 is an apocalyptic number.
It is an amenable number.
1474517061133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1474517061133 is an equidigital number, since it uses as much as digits as its factorization.
1474517061133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 211680, while the sum is 43.
The spelling of 1474517061133 in words is "one trillion, four hundred seventy-four billion, five hundred seventeen million, sixty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •