Base | Representation |
---|---|
bin | 1001100011110000110110… |
… | …11011110110000111110111 |
3 | 2202102111101001022002120100 |
4 | 10301320123123312013313 |
5 | 10223343010214343111 |
6 | 112412245114005143 |
7 | 4266434641644636 |
oct | 461703333660767 |
9 | 82374331262510 |
10 | 21020030231031 |
11 | 67745aa08aa77 |
12 | 24359a57167b3 |
13 | b962462b0390 |
14 | 5295369b951d |
15 | 266ba4d3a756 |
hex | 131e1b6f61f7 |
21020030231031 has 48 divisors (see below), whose sum is σ = 34082767429984. Its totient is φ = 12397949828352.
The previous prime is 21020030231023. The next prime is 21020030231047. The reversal of 21020030231031 is 13013203002012.
21020030231031 is a `hidden beast` number, since 2 + 1 + 0 + 20 + 0 + 302 + 310 + 31 = 666.
It is not a de Polignac number, because 21020030231031 - 23 = 21020030231023 is a prime.
It is a super-2 number, since 2×210200302310312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21020030230995 and 21020030231013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020030231021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35946016 + ... + 36526101.
Almost surely, 221020030231031 is an apocalyptic number.
21020030231031 is a deficient number, since it is larger than the sum of its proper divisors (13062737198953).
21020030231031 is a wasteful number, since it uses less digits than its factorization.
21020030231031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72472240 (or 72472237 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 21020030231031 its reverse (13013203002012), we get a palindrome (34033233233043).
The spelling of 21020030231031 in words is "twenty-one trillion, twenty billion, thirty million, two hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •