Base | Representation |
---|---|
bin | 1001001000111111010111… |
… | …00000110001000001001101 |
3 | 2122011112212202022121201002 |
4 | 10210133223200301001031 |
5 | 10113310002410310013 |
6 | 110425505425230045 |
7 | 4143120203214206 |
oct | 444375340610115 |
9 | 78145782277632 |
10 | 20100103213133 |
11 | 644a451289749 |
12 | 230764ba92325 |
13 | b2a57c2c0628 |
14 | 4d6bc8ca85ad |
15 | 24ccb31ac358 |
hex | 1247eb83104d |
20100103213133 has 4 divisors (see below), whose sum is σ = 20100182323200. Its totient is φ = 20100024103068.
The previous prime is 20100103213117. The next prime is 20100103213199. The reversal of 20100103213133 is 33131230100102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20100103213133 - 24 = 20100103213117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100103113133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39172685 + ... + 39682482.
It is an arithmetic number, because the mean of its divisors is an integer number (5025045580800).
Almost surely, 220100103213133 is an apocalyptic number.
It is an amenable number.
20100103213133 is a deficient number, since it is larger than the sum of its proper divisors (79110067).
20100103213133 is an equidigital number, since it uses as much as digits as its factorization.
20100103213133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79110066.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20100103213133 its reverse (33131230100102), we get a palindrome (53231333313235).
The spelling of 20100103213133 in words is "twenty trillion, one hundred billion, one hundred three million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •