Base | Representation |
---|---|
bin | 10011101010111011… |
… | …011011000110110101 |
3 | 2000111222110222121022 |
4 | 103222323123012311 |
5 | 321224024042003 |
6 | 13411503030525 |
7 | 1345256134403 |
oct | 235273330665 |
9 | 60458428538 |
10 | 21121315253 |
11 | 8a59482845 |
12 | 411559b445 |
13 | 1cb7aac59c |
14 | 10451b2473 |
15 | 839412738 |
hex | 4eaedb1b5 |
21121315253 has 4 divisors (see below), whose sum is σ = 22363745580. Its totient is φ = 19878884928.
The previous prime is 21121315217. The next prime is 21121315277. The reversal of 21121315253 is 35251312112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11465698084 + 9655617169 = 107078^2 + 98263^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121315253 - 222 = 21117120949 is a prime.
It is a super-2 number, since 2×211213152532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21121315153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 621215138 + ... + 621215171.
It is an arithmetic number, because the mean of its divisors is an integer number (5590936395).
Almost surely, 221121315253 is an apocalyptic number.
It is an amenable number.
21121315253 is a deficient number, since it is larger than the sum of its proper divisors (1242430327).
21121315253 is a wasteful number, since it uses less digits than its factorization.
21121315253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242430326.
The product of its digits is 1800, while the sum is 26.
Adding to 21121315253 its reverse (35251312112), we get a palindrome (56372627365).
The spelling of 21121315253 in words is "twenty-one billion, one hundred twenty-one million, three hundred fifteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •