Base | Representation |
---|---|
bin | 1011101010001110110… |
… | …1010010010101101101 |
3 | 201011001022010001112122 |
4 | 2322203231102111231 |
5 | 11240221123202141 |
6 | 232005022442325 |
7 | 20320664601050 |
oct | 2724355222555 |
9 | 634038101478 |
10 | 200315053421 |
11 | 77a5369752a |
12 | 329a51333a5 |
13 | 15b7468aa12 |
14 | 99a3c92a97 |
15 | 5325e5864b |
hex | 2ea3b5256d |
200315053421 has 8 divisors (see below), whose sum is σ = 231071037120. Its totient is φ = 170093956608.
The previous prime is 200315053387. The next prime is 200315053459. The reversal of 200315053421 is 124350513002.
It is a happy number.
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 200315053421 - 210 = 200315052397 is a prime.
It is a super-5 number, since 5×2003150534215 (a number of 58 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200315053481) 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, 133720916 + ... + 133722413.
It is an arithmetic number, because the mean of its divisors is an integer number (28883879640).
Almost surely, 2200315053421 is an apocalyptic number.
It is an amenable number.
200315053421 is a deficient number, since it is larger than the sum of its proper divisors (30755983699).
200315053421 is a wasteful number, since it uses less digits than its factorization.
200315053421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267443443.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 200315053421 its reverse (124350513002), we get a palindrome (324665566423).
The spelling of 200315053421 in words is "two hundred billion, three hundred fifteen million, fifty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •