Base | Representation |
---|---|
bin | 10010101110000111… |
… | …010001101101101011 |
3 | 1220212212121020010012 |
4 | 102232013101231223 |
5 | 312131324343311 |
6 | 13122334242135 |
7 | 1311056533331 |
oct | 225607215553 |
9 | 56785536105 |
10 | 20101012331 |
11 | 8585552094 |
12 | 3a8b95634b |
13 | 1b845b414a |
14 | d8989bb51 |
15 | 7c9a7078b |
hex | 4ae1d1b6b |
20101012331 has 4 divisors (see below), whose sum is σ = 20101412472. Its totient is φ = 20100612192.
The previous prime is 20101012301. The next prime is 20101012367. The reversal of 20101012331 is 13321010102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13321010102 = 2 ⋅6660505051.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101012331 is a prime.
It is a super-2 number, since 2×201010123312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101012301) 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 3 ways as a sum of consecutive naturals, for example, 111710 + ... + 229523.
It is an arithmetic number, because the mean of its divisors is an integer number (5025353118).
Almost surely, 220101012331 is an apocalyptic number.
20101012331 is a deficient number, since it is larger than the sum of its proper divisors (400141).
20101012331 is an equidigital number, since it uses as much as digits as its factorization.
20101012331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400140.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20101012331 its reverse (13321010102), we get a palindrome (33422022433).
The spelling of 20101012331 in words is "twenty billion, one hundred one million, twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •