Base | Representation |
---|---|
bin | 11000000111001011000010… |
… | …00101111101001010001101 |
3 | 20221201221122001101210101010 |
4 | 30003211201011331022031 |
5 | 23422212101024022201 |
6 | 304434232515235433 |
7 | 14111533242343116 |
oct | 1403454105751215 |
9 | 227657561353333 |
10 | 53023000220301 |
11 | 15992a233547a1 |
12 | 5b442675a8b79 |
13 | 237808038b397 |
14 | d1448104920d |
15 | 61e3b3708bd6 |
hex | 30396117d28d |
53023000220301 has 8 divisors (see below), whose sum is σ = 71397307227744. Its totient is φ = 34998680013200.
The previous prime is 53023000220237. The next prime is 53023000220317. The reversal of 53023000220301 is 10302200032035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53023000220301 - 26 = 53023000220237 is a prime.
It is a super-2 number, since 2×530230002203012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53023000220401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87496699731 + ... + 87496700336.
It is an arithmetic number, because the mean of its divisors is an integer number (8924663403468).
Almost surely, 253023000220301 is an apocalyptic number.
It is an amenable number.
53023000220301 is a deficient number, since it is larger than the sum of its proper divisors (18374307007443).
53023000220301 is a wasteful number, since it uses less digits than its factorization.
53023000220301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174993400171.
The product of its (nonzero) digits is 1080, while the sum is 21.
Adding to 53023000220301 its reverse (10302200032035), we get a palindrome (63325200252336).
The spelling of 53023000220301 in words is "fifty-three trillion, twenty-three billion, two hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •