Base | Representation |
---|---|
bin | 1001001011111101111110… |
… | …1100111110001010001001 |
3 | 1022202200000110211001100112 |
4 | 2102333133230332022021 |
5 | 2310444300113033001 |
6 | 33252234215044105 |
7 | 2061534451464011 |
oct | 222773754761211 |
9 | 38680013731315 |
10 | 10101221221001 |
11 | 32449a404a579 |
12 | 1171826670635 |
13 | 58370597c531 |
14 | 26cc8a444c41 |
15 | 127b514aacbb |
hex | 92fdfb3e289 |
10101221221001 has 6 divisors (see below), whose sum is σ = 10275330179802. Its totient is φ = 9930014078240.
The previous prime is 10101221220977. The next prime is 10101221221019. The reversal of 10101221221001 is 10012212210101.
It can be written as a sum of positive squares in only one way, i.e., 7953528040000 + 2147693181001 = 2820200^2 + 1465501^2 .
It is a de Polignac number, because none of the positive numbers 2k-10101221221001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10101221221061) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1450904480 + ... + 1450911441.
It is an arithmetic number, because the mean of its divisors is an integer number (1712555029967).
Almost surely, 210101221221001 is an apocalyptic number.
It is an amenable number.
10101221221001 is a deficient number, since it is larger than the sum of its proper divisors (174108958801).
10101221221001 is an frugal number, since it uses more digits than its factorization.
10101221221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2901816039 (or 2901815980 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10101221221001 its reverse (10012212210101), we get a palindrome (20113433431102).
The spelling of 10101221221001 in words is "ten trillion, one hundred one billion, two hundred twenty-one million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •