Base | Representation |
---|---|
bin | 101110101010010000… |
… | …0010011011001100101 |
3 | 100120122020202002221001 |
4 | 1131110200103121211 |
5 | 3120203203031041 |
6 | 114010540353301 |
7 | 10145045651452 |
oct | 1352440233145 |
9 | 316566662831 |
10 | 100202002021 |
11 | 3954a466220 |
12 | 17505545831 |
13 | 95ab618074 |
14 | 4bc7c04829 |
15 | 2916d3c131 |
hex | 1754813665 |
100202002021 has 16 divisors (see below), whose sum is σ = 119732437440. Its totient is φ = 82777972480.
The previous prime is 100202002007. The next prime is 100202002027. The reversal of 100202002021 is 120200202001.
It is a cyclic number.
It is not a de Polignac number, because 100202002021 - 227 = 100067784293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100202001989 and 100202002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100202002027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9233191 + ... + 9244036.
It is an arithmetic number, because the mean of its divisors is an integer number (7483277340).
Almost surely, 2100202002021 is an apocalyptic number.
100202002021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100202002021 is a deficient number, since it is larger than the sum of its proper divisors (19530435419).
100202002021 is a wasteful number, since it uses less digits than its factorization.
100202002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18477284.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 100202002021 its reverse (120200202001), we get a palindrome (220402204022).
The spelling of 100202002021 in words is "one hundred billion, two hundred two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •