Base | Representation |
---|---|
bin | 10010101110000111… |
… | …010001111101010011 |
3 | 1220212212121021111020 |
4 | 102232013101331103 |
5 | 312131324411311 |
6 | 13122334250523 |
7 | 1311056536260 |
oct | 225607217523 |
9 | 56785537436 |
10 | 20101013331 |
11 | 8585552913 |
12 | 3a8b956a43 |
13 | 1b845b4739 |
14 | d8989c267 |
15 | 7c9a70c06 |
hex | 4ae1d1f53 |
20101013331 has 32 divisors (see below), whose sum is σ = 31091025408. Its totient is φ = 11313872640.
The previous prime is 20101013329. The next prime is 20101013341. The reversal of 20101013331 is 13331010102.
It is not a de Polignac number, because 20101013331 - 21 = 20101013329 is a prime.
It is a super-2 number, since 2×201010133312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20101013331.
It is not an unprimeable number, because it can be changed into a prime (20101013321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1198141 + ... + 1214801.
It is an arithmetic number, because the mean of its divisors is an integer number (971594544).
Almost surely, 220101013331 is an apocalyptic number.
20101013331 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20101013331 is a deficient number, since it is larger than the sum of its proper divisors (10990012077).
20101013331 is a wasteful number, since it uses less digits than its factorization.
20101013331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17531.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 20101013331 its reverse (13331010102), we get a palindrome (33432023433).
The spelling of 20101013331 in words is "twenty billion, one hundred one million, thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •