Base | Representation |
---|---|
bin | 1001010010010100000010… |
… | …0010110010000001011001 |
3 | 1100011002100210110221100021 |
4 | 2110211000202302001121 |
5 | 2314241012322402301 |
6 | 33414302123510441 |
7 | 2102443526036041 |
oct | 224450042620131 |
9 | 40132323427307 |
10 | 10210220122201 |
11 | 3287148096300 |
12 | 118a986088421 |
13 | 590a86946088 |
14 | 27426a6b2721 |
15 | 12a8d07568a1 |
hex | 949408b2059 |
10210220122201 has 24 divisors (see below), whose sum is σ = 11409349089992. Its totient is φ = 9127801267200.
The previous prime is 10210220122181. The next prime is 10210220122217. The reversal of 10210220122201 is 10222102201201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 124657225 + 10210095464976 = 11165^2 + 3195324^2 .
It is a de Polignac number, because none of the positive numbers 2k-10210220122201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10210220122301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33157195 + ... + 33463711.
Almost surely, 210210220122201 is an apocalyptic number.
10210220122201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10210220122201 is a deficient number, since it is larger than the sum of its proper divisors (1199128967791).
10210220122201 is a wasteful number, since it uses less digits than its factorization.
10210220122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311113 (or 311102 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10210220122201 its reverse (10222102201201), we get a palindrome (20432322323402).
The spelling of 10210220122201 in words is "ten trillion, two hundred ten billion, two hundred twenty million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •