Base | Representation |
---|---|
bin | 11101110111011101000… |
… | …11101111001010000101 |
3 | 10122002210221221002210100 |
4 | 32323232203233022011 |
5 | 113303131331441203 |
6 | 2103233141114313 |
7 | 134066206566066 |
oct | 16735643571205 |
9 | 3562727832710 |
10 | 1026204562053 |
11 | 3662357a4250 |
12 | 146a759b8999 |
13 | 75a03232b68 |
14 | 3795078a56d |
15 | 1ba62075ea3 |
hex | eeee8ef285 |
1026204562053 has 12 divisors (see below), whose sum is σ = 1617049613088. Its totient is φ = 621942158760.
The previous prime is 1026204562049. The next prime is 1026204562073. The reversal of 1026204562053 is 3502654026201.
1026204562053 is a `hidden beast` number, since 1 + 0 + 2 + 6 + 20 + 4 + 5 + 620 + 5 + 3 = 666.
It is not a de Polignac number, because 1026204562053 - 22 = 1026204562049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1026204561999 and 1026204562017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1026204562073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5182851225 + ... + 5182851422.
It is an arithmetic number, because the mean of its divisors is an integer number (134754134424).
Almost surely, 21026204562053 is an apocalyptic number.
It is an amenable number.
1026204562053 is a deficient number, since it is larger than the sum of its proper divisors (590845051035).
1026204562053 is a wasteful number, since it uses less digits than its factorization.
1026204562053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10365702664 (or 10365702661 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 1026204562053 its reverse (3502654026201), we get a palindrome (4528858588254).
The spelling of 1026204562053 in words is "one trillion, twenty-six billion, two hundred four million, five hundred sixty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •