Base | Representation |
---|---|
bin | 1001100110111111100101… |
… | …11100010011000111010111 |
3 | 2202211002212010011200012202 |
4 | 10303133302330103013113 |
5 | 10232202312111202411 |
6 | 112535242342235115 |
7 | 4310444242420010 |
oct | 463376274230727 |
9 | 82732763150182 |
10 | 21131020022231 |
11 | 6807684a10939 |
12 | 24533bba25a9b |
13 | ba3853881842 |
14 | 530a65410007 |
15 | 2699edc9983b |
hex | 1337f2f131d7 |
21131020022231 has 8 divisors (see below), whose sum is σ = 24164709119904. Its totient is φ = 18101073912480.
The previous prime is 21131020022227. The next prime is 21131020022237. The reversal of 21131020022231 is 13222002013112.
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 21131020022231 - 22 = 21131020022227 is a prime.
It is a super-2 number, since 2×211310200222312 (a number of 27 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 (21131020022237) 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, 935734880 + ... + 935757461.
It is an arithmetic number, because the mean of its divisors is an integer number (3020588639988).
Almost surely, 221131020022231 is an apocalyptic number.
21131020022231 is a deficient number, since it is larger than the sum of its proper divisors (3033689097673).
21131020022231 is a wasteful number, since it uses less digits than its factorization.
21131020022231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871493961.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21131020022231 its reverse (13222002013112), we get a palindrome (34353022035343).
The spelling of 21131020022231 in words is "twenty-one trillion, one hundred thirty-one billion, twenty million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •