Base | Representation |
---|---|
bin | 11101011001101001010… |
… | …11110011000101000001 |
3 | 10120120111122210122111010 |
4 | 32230310223303011001 |
5 | 113022343002224301 |
6 | 2052025141511133 |
7 | 132661504421400 |
oct | 16546453630501 |
9 | 3516448718433 |
10 | 1010201211201 |
11 | 35a47327a956 |
12 | 14394a4124a9 |
13 | 743528756a0 |
14 | 36c731c5637 |
15 | 1b42711c5d6 |
hex | eb34af3141 |
1010201211201 has 48 divisors (see below), whose sum is σ = 1687681492224. Its totient is φ = 532754724096.
The previous prime is 1010201211199. The next prime is 1010201211221. The reversal of 1010201211201 is 1021121020101.
1010201211201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1010201211201 - 21 = 1010201211199 is a prime.
It is a super-2 number, since 2×10102012112012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1010201211221) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10917336 + ... + 11009478.
It is an arithmetic number, because the mean of its divisors is an integer number (35160031088).
Almost surely, 21010201211201 is an apocalyptic number.
It is an amenable number.
1010201211201 is a deficient number, since it is larger than the sum of its proper divisors (677480281023).
1010201211201 is a wasteful number, since it uses less digits than its factorization.
1010201211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97910 (or 97903 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1010201211201 its reverse (1021121020101), we get a palindrome (2031322231302).
The spelling of 1010201211201 in words is "one trillion, ten billion, two hundred one million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •