Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …01010000001100101010011 |
3 | 2122011122012110211202212001 |
4 | 10210200201022001211103 |
5 | 10113313323311040311 |
6 | 110430135015414431 |
7 | 4143151412155624 |
oct | 444404112014523 |
9 | 78148173752761 |
10 | 20101003221331 |
11 | 644a87331717a |
12 | 2307861384417 |
13 | b2a6938ba966 |
14 | 4d6c72627a4b |
15 | 24cd171db4c1 |
hex | 124821281953 |
20101003221331 has 16 divisors (see below), whose sum is σ = 21211240564800. Its totient is φ = 19010468302848.
The previous prime is 20101003221323. The next prime is 20101003221391. The reversal of 20101003221331 is 13312230010102.
It is a cyclic number.
It is not a de Polignac number, because 20101003221331 - 23 = 20101003221323 is a prime.
It is a super-2 number, since 2×201010032213312 (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 = 20101003221299 and 20101003221308.
It is not an unprimeable number, because it can be changed into a prime (20101003221311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83596105 + ... + 83836213.
It is an arithmetic number, because the mean of its divisors is an integer number (1325702535300).
Almost surely, 220101003221331 is an apocalyptic number.
20101003221331 is a deficient number, since it is larger than the sum of its proper divisors (1110237343469).
20101003221331 is a wasteful number, since it uses less digits than its factorization.
20101003221331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281118.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20101003221331 its reverse (13312230010102), we get a palindrome (33413233231433).
The spelling of 20101003221331 in words is "twenty trillion, one hundred one billion, three million, two hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •