Base | Representation |
---|---|
bin | 10110110010001111111011… |
… | …100010001010100001110011 |
3 | 111010210222210022100000022211 |
4 | 112302033323202022201303 |
5 | 101113320242104121321 |
6 | 553043515122112551 |
7 | 30051640513636231 |
oct | 2662177342124163 |
9 | 433728708300284 |
10 | 100210102020211 |
11 | 29a25958133707 |
12 | b2a54804ab757 |
13 | 43bba06322771 |
14 | 1aa62a2811951 |
15 | b8ba64a550e1 |
hex | 5b23fb88a873 |
100210102020211 has 4 divisors (see below), whose sum is σ = 100213058714832. Its totient is φ = 100207145325592.
The previous prime is 100210102020121. The next prime is 100210102020221. The reversal of 100210102020211 is 112020201012001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100210102020211 - 225 = 100210068465779 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100210102020191 and 100210102020200.
It is not an unprimeable number, because it can be changed into a prime (100210102020221) 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, 1478296471 + ... + 1478364256.
It is an arithmetic number, because the mean of its divisors is an integer number (25053264678708).
Almost surely, 2100210102020211 is an apocalyptic number.
100210102020211 is a deficient number, since it is larger than the sum of its proper divisors (2956694621).
100210102020211 is an equidigital number, since it uses as much as digits as its factorization.
100210102020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2956694620.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100210102020211 its reverse (112020201012001), we get a palindrome (212230303032212).
The spelling of 100210102020211 in words is "one hundred trillion, two hundred ten billion, one hundred two million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •