Base | Representation |
---|---|
bin | 1001010010010110111100… |
… | …1010010000011001111001 |
3 | 1100011011101022010201211221 |
4 | 2110211233022100121321 |
5 | 2314244113032102301 |
6 | 33414511502552041 |
7 | 2102502103551004 |
oct | 224455712203171 |
9 | 40134338121757 |
10 | 10211002222201 |
11 | 3287509610640 |
12 | 118ab63b98621 |
13 | 590b7c99c641 |
14 | 2743024dc53b |
15 | 12a929244da1 |
hex | 9496f290679 |
10211002222201 has 8 divisors (see below), whose sum is σ = 11139921825408. Its totient is φ = 9282190398000.
The previous prime is 10211002222199. The next prime is 10211002222247. The reversal of 10211002222201 is 10222220011201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10211002222201 - 21 = 10211002222199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211002222261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26746590 + ... + 27125671.
It is an arithmetic number, because the mean of its divisors is an integer number (1392490228176).
Almost surely, 210211002222201 is an apocalyptic number.
10211002222201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10211002222201 is a deficient number, since it is larger than the sum of its proper divisors (928919603207).
10211002222201 is a wasteful number, since it uses less digits than its factorization.
10211002222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53889503.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10211002222201 its reverse (10222220011201), we get a palindrome (20433222233402).
The spelling of 10211002222201 in words is "ten trillion, two hundred eleven billion, two million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •