Base | Representation |
---|---|
bin | 1001101010101000011100… |
… | …01001000101100100010111 |
3 | 2210021001112022021102000202 |
4 | 10311110032021011210113 |
5 | 10241224322241123111 |
6 | 113112515140531115 |
7 | 4322461151245643 |
oct | 465241611054427 |
9 | 83231468242022 |
10 | 21256030411031 |
11 | 68556a5029249 |
12 | 24736896b0a9b |
13 | bb2586ac42c0 |
14 | 536b23d5dc23 |
15 | 26cdb8a59b3b |
hex | 13550e245917 |
21256030411031 has 32 divisors (see below), whose sum is σ = 23326884403200. Its totient is φ = 19250844238080.
The previous prime is 21256030411027. The next prime is 21256030411079. The reversal of 21256030411031 is 13011403065212.
It is not a de Polignac number, because 21256030411031 - 22 = 21256030411027 is a prime.
It is a super-2 number, since 2×212560304110312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21256030410985 and 21256030411003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21256030411331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 140127155 + ... + 140278763.
It is an arithmetic number, because the mean of its divisors is an integer number (728965137600).
Almost surely, 221256030411031 is an apocalyptic number.
21256030411031 is a deficient number, since it is larger than the sum of its proper divisors (2070853992169).
21256030411031 is a wasteful number, since it uses less digits than its factorization.
21256030411031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152559.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 21256030411031 its reverse (13011403065212), we get a palindrome (34267433476243).
The spelling of 21256030411031 in words is "twenty-one trillion, two hundred fifty-six billion, thirty million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •