Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1000100011110110011001 |
3 | 1100011002001102110012200101 |
4 | 2110210321120203312121 |
5 | 2314240241100032301 |
6 | 33414242153135401 |
7 | 2102440540035001 |
oct | 224447130436631 |
9 | 40132042405611 |
10 | 10210100002201 |
11 | 3287096302380 |
12 | 118a9519ba561 |
13 | 590a67aa9658 |
14 | 274258765001 |
15 | 12a8c4e2a701 |
hex | 94939623d99 |
10210100002201 has 16 divisors (see below), whose sum is σ = 11522718063360. Its totient is φ = 8961572475520.
The previous prime is 10210100002181. The next prime is 10210100002253. The reversal of 10210100002201 is 10220000101201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10210100002201 is a prime.
It is a super-2 number, since 2×102101000022012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10210100006201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10479456 + ... + 11412238.
It is an arithmetic number, because the mean of its divisors is an integer number (720169878960).
Almost surely, 210210100002201 is an apocalyptic number.
10210100002201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10210100002201 is a deficient number, since it is larger than the sum of its proper divisors (1312618061159).
10210100002201 is a wasteful number, since it uses less digits than its factorization.
10210100002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967136.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10210100002201 its reverse (10220000101201), we get a palindrome (20430100103402).
The spelling of 10210100002201 in words is "ten trillion, two hundred ten billion, one hundred million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •