Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …111110101001000111100011 |
3 | 111020121121021210221020111110 |
4 | 112331300201332221013203 |
5 | 101214300042334032321 |
6 | 554451121204514403 |
7 | 30163040312234151 |
oct | 2675604176510743 |
9 | 436547253836443 |
10 | 101001021002211 |
11 | 2a2003242a0150 |
12 | b3b28116aba03 |
13 | 4448480ac32b5 |
14 | 1ad2692ab23d1 |
15 | ba24059b5176 |
hex | 5bdc21fa91e3 |
101001021002211 has 8 divisors (see below), whose sum is σ = 146910576003264. Its totient is φ = 61212740001320.
The previous prime is 101001021002137. The next prime is 101001021002239. The reversal of 101001021002211 is 112200120100101.
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 101001021002211 - 213 = 101001020994019 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101001021022211) 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, 1530318500001 + ... + 1530318500066.
It is an arithmetic number, because the mean of its divisors is an integer number (18363822000408).
Almost surely, 2101001021002211 is an apocalyptic number.
101001021002211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101001021002211 is a deficient number, since it is larger than the sum of its proper divisors (45909555001053).
101001021002211 is a wasteful number, since it uses less digits than its factorization.
101001021002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3060637000081.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101001021002211 its reverse (112200120100101), we get a palindrome (213201141102312).
The spelling of 101001021002211 in words is "one hundred one trillion, one billion, twenty-one million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •