Base | Representation |
---|---|
bin | 1001010010010011001101… |
… | …1111101010100000110001 |
3 | 1100011001210112112121012002 |
4 | 2110210303133222200301 |
5 | 2314240040301414301 |
6 | 33414224303343345 |
7 | 2102435230165304 |
oct | 224446337524061 |
9 | 40131715477162 |
10 | 10210001201201 |
11 | 328704555a75a |
12 | 118a9248b1b55 |
13 | 590a50495819 |
14 | 2742495a6b3b |
15 | 12a8bb41116b |
hex | 949337ea831 |
10210001201201 has 8 divisors (see below), whose sum is σ = 10811519979624. Its totient is φ = 9608585808640.
The previous prime is 10210001201119. The next prime is 10210001201237. The reversal of 10210001201201 is 10210210001201.
It can be written as a sum of positive squares in 4 ways, for example, as 3479344090000 + 6730657111201 = 1865300^2 + 2594351^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10210001201201 - 210 = 10210001200177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10210001221201) 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, 25643090 + ... + 26038203.
It is an arithmetic number, because the mean of its divisors is an integer number (1351439997453).
Almost surely, 210210001201201 is an apocalyptic number.
It is an amenable number.
10210001201201 is a deficient number, since it is larger than the sum of its proper divisors (601518778423).
10210001201201 is a wasteful number, since it uses less digits than its factorization.
10210001201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51692931.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10210001201201 its reverse (10210210001201), we get a palindrome (20420211202402).
The spelling of 10210001201201 in words is "ten trillion, two hundred ten billion, one million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •