Base | Representation |
---|---|
bin | 11101110010000010111… |
… | …01110100100110011001 |
3 | 10121211022120112011102200 |
4 | 32321001131310212121 |
5 | 113231204420144423 |
6 | 2102033042120413 |
7 | 133634225120526 |
oct | 16710135644631 |
9 | 3554276464380 |
10 | 1023300553113 |
11 | 364a85537363 |
12 | 1463a5350109 |
13 | 7565c6ba487 |
14 | 37756c1014d |
15 | 1b942143d43 |
hex | ee41774999 |
1023300553113 has 24 divisors (see below), whose sum is σ = 1482821683200. Its totient is φ = 680024263680.
The previous prime is 1023300553109. The next prime is 1023300553117. The reversal of 1023300553113 is 3113550033201.
1023300553113 is a `hidden beast` number, since 10 + 2 + 330 + 0 + 5 + 5 + 311 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (1023300553109) and next prime (1023300553117).
It is not a de Polignac number, because 1023300553113 - 22 = 1023300553109 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1023300553117) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4358088 + ... + 4586886.
It is an arithmetic number, because the mean of its divisors is an integer number (61784236800).
Almost surely, 21023300553113 is an apocalyptic number.
It is an amenable number.
1023300553113 is a deficient number, since it is larger than the sum of its proper divisors (459521130087).
1023300553113 is a wasteful number, since it uses less digits than its factorization.
1023300553113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230389 (or 230386 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 1023300553113 its reverse (3113550033201), we get a palindrome (4136850586314).
The spelling of 1023300553113 in words is "one trillion, twenty-three billion, three hundred million, five hundred fifty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •