Base | Representation |
---|---|
bin | 1001001011111110011000… |
… | …1111110100110110010001 |
3 | 1022202200022010102110220121 |
4 | 2102333212033310312101 |
5 | 2311000011220134301 |
6 | 33252253140310241 |
7 | 2061540253664140 |
oct | 222774617646621 |
9 | 38680263373817 |
10 | 10101331021201 |
11 | 3244a50025042 |
12 | 11718573a2381 |
13 | 583722644974 |
14 | 26cc9ac67757 |
15 | 127b5ae493a1 |
hex | 92fe63f4d91 |
10101331021201 has 8 divisors (see below), whose sum is σ = 11613506325120. Its totient is φ = 8606437721088.
The previous prime is 10101331021153. The next prime is 10101331021213. The reversal of 10101331021201 is 10212013310101.
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 10101331021201 - 239 = 9551575207313 is a prime.
It is a super-2 number, since 2×101013310212012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10101331021231) 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, 4320499696 + ... + 4320502033.
It is an arithmetic number, because the mean of its divisors is an integer number (1451688290640).
Almost surely, 210101331021201 is an apocalyptic number.
It is an amenable number.
10101331021201 is a deficient number, since it is larger than the sum of its proper divisors (1512175303919).
10101331021201 is an equidigital number, since it uses as much as digits as its factorization.
10101331021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8641001903.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10101331021201 its reverse (10212013310101), we get a palindrome (20313344331302).
The spelling of 10101331021201 in words is "ten trillion, one hundred one billion, three hundred thirty-one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •