Base | Representation |
---|---|
bin | 10010110001001101… |
… | …110010010100110101 |
3 | 1221000111112000221212 |
4 | 102301031302110311 |
5 | 312233140103141 |
6 | 13131433451205 |
7 | 1312261050020 |
oct | 226115622465 |
9 | 57014460855 |
10 | 20153050421 |
11 | 8601965079 |
12 | 3aa5270b05 |
13 | 1b9230410a |
14 | d927661b7 |
15 | 7ce3ee2eb |
hex | 4b1372535 |
20153050421 has 8 divisors (see below), whose sum is σ = 23033222400. Its totient is φ = 17273169648.
The previous prime is 20153050391. The next prime is 20153050457. The reversal of 20153050421 is 12405035102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20153050421 is a prime.
It is a super-3 number, since 3×201530504213 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20153052421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104195 + ... + 226191.
It is an arithmetic number, because the mean of its divisors is an integer number (2879152800).
Almost surely, 220153050421 is an apocalyptic number.
It is an amenable number.
20153050421 is a deficient number, since it is larger than the sum of its proper divisors (2880171979).
20153050421 is a wasteful number, since it uses less digits than its factorization.
20153050421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145603.
The product of its (nonzero) digits is 1200, while the sum is 23.
Adding to 20153050421 its reverse (12405035102), we get a palindrome (32558085523).
The spelling of 20153050421 in words is "twenty billion, one hundred fifty-three million, fifty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •