Base | Representation |
---|---|
bin | 11110101010100000000… |
… | …01001110000111011011 |
3 | 10201201112212010102100202 |
4 | 33111100001032013123 |
5 | 114230243012003023 |
6 | 2124004351452415 |
7 | 136056265565663 |
oct | 17252001160733 |
9 | 3651485112322 |
10 | 1053609484763 |
11 | 3769190a5300 |
12 | 15024382710b |
13 | 7847ca89864 |
14 | 38dd02b51a3 |
15 | 1c617e43128 |
hex | f55004e1db |
1053609484763 has 12 divisors (see below), whose sum is σ = 1219052299080. Its totient is φ = 907414865280.
The previous prime is 1053609484709. The next prime is 1053609484769. The reversal of 1053609484763 is 3674849063501.
It is not a de Polignac number, because 1053609484763 - 210 = 1053609483739 is a prime.
It is a super-3 number, since 3×10536094847633 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1053609484699 and 1053609484708.
It is not an unprimeable number, because it can be changed into a prime (1053609484769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 229142870 + ... + 229147467.
It is an arithmetic number, because the mean of its divisors is an integer number (101587691590).
Almost surely, 21053609484763 is an apocalyptic number.
1053609484763 is a deficient number, since it is larger than the sum of its proper divisors (165442814317).
1053609484763 is a wasteful number, since it uses less digits than its factorization.
1053609484763 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458290378 (or 458290367 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 56.
The spelling of 1053609484763 in words is "one trillion, fifty-three billion, six hundred nine million, four hundred eighty-four thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •