Base | Representation |
---|---|
bin | 10010110100000010… |
… | …01111100101100101 |
3 | 222001220022211102122 |
4 | 21122001033211211 |
5 | 131141123210041 |
6 | 4350122315325 |
7 | 505202240306 |
oct | 113201174545 |
9 | 28056284378 |
10 | 10100210021 |
11 | 431333a310 |
12 | 1b5a658b45 |
13 | c4c6a5745 |
14 | 6bb5aa7ad |
15 | 3e1aa4c4b |
hex | 25a04f965 |
10100210021 has 4 divisors (see below), whose sum is σ = 11018410944. Its totient is φ = 9182009100.
The previous prime is 10100210011. The next prime is 10100210023. The reversal of 10100210021 is 12001200101.
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 de Polignac number, because none of the positive numbers 2k-10100210021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100209990 and 10100210008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100210023) 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, 459100445 + ... + 459100466.
It is an arithmetic number, because the mean of its divisors is an integer number (2754602736).
Almost surely, 210100210021 is an apocalyptic number.
10100210021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10100210021 is a deficient number, since it is larger than the sum of its proper divisors (918200923).
10100210021 is an equidigital number, since it uses as much as digits as its factorization.
10100210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 918200922.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10100210021 its reverse (12001200101), we get a palindrome (22101410122).
The spelling of 10100210021 in words is "ten billion, one hundred million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •