Base | Representation |
---|---|
bin | 1001010001110101110010… |
… | …0111101000001101110011 |
3 | 1100010022101222022222120120 |
4 | 2110131130213220031303 |
5 | 2314122400403021321 |
6 | 33410440335341323 |
7 | 2102035402356615 |
oct | 224353447501563 |
9 | 40108358288516 |
10 | 10202101220211 |
11 | 328376119704a |
12 | 118929b081843 |
13 | 5900918a1a64 |
14 | 273ada2d6db5 |
15 | 12a5a7ac0ec6 |
hex | 9475c9e8373 |
10202101220211 has 8 divisors (see below), whose sum is σ = 13613798237904. Its totient is φ = 6795902508000.
The previous prime is 10202101220203. The next prime is 10202101220243. The reversal of 10202101220211 is 11202210120201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10202101220211 - 23 = 10202101220203 is a prime.
It is a super-2 number, since 2×102021012202112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10202101220261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1374572040 + ... + 1374579461.
It is an arithmetic number, because the mean of its divisors is an integer number (1701724779738).
Almost surely, 210202101220211 is an apocalyptic number.
10202101220211 is a deficient number, since it is larger than the sum of its proper divisors (3411697017693).
10202101220211 is a wasteful number, since it uses less digits than its factorization.
10202101220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2749152741.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10202101220211 its reverse (11202210120201), we get a palindrome (21404311340412).
The spelling of 10202101220211 in words is "ten trillion, two hundred two billion, one hundred one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •