Base | Representation |
---|---|
bin | 11110101001111011001… |
… | …01100001010100110001 |
3 | 10201200202022012211102001 |
4 | 33110331211201110301 |
5 | 114224124324433041 |
6 | 2123513543254001 |
7 | 136045522155604 |
oct | 17247545412461 |
9 | 3650668184361 |
10 | 1053300233521 |
11 | 37677a582268 |
12 | 15017814a301 |
13 | 7843099cc63 |
14 | 38da11b433b |
15 | 1c5eac08131 |
hex | f53d961531 |
1053300233521 has 16 divisors (see below), whose sum is σ = 1106149575168. Its totient is φ = 1001052360000.
The previous prime is 1053300233473. The next prime is 1053300233527. The reversal of 1053300233521 is 1253320033501.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1053300233521 is a prime.
It is a super-2 number, since 2×10533002335212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1053300233521.
It is not an unprimeable number, because it can be changed into a prime (1053300233527) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3248011 + ... + 3557551.
It is an arithmetic number, because the mean of its divisors is an integer number (69134348448).
Almost surely, 21053300233521 is an apocalyptic number.
It is an amenable number.
1053300233521 is a deficient number, since it is larger than the sum of its proper divisors (52849341647).
1053300233521 is a wasteful number, since it uses less digits than its factorization.
1053300233521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310512.
The product of its (nonzero) digits is 8100, while the sum is 28.
It can be divided in two parts, 1053300 and 233521, that added together give a palindrome (1286821).
The spelling of 1053300233521 in words is "one trillion, fifty-three billion, three hundred million, two hundred thirty-three thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •