Base | Representation |
---|---|
bin | 10111000000111101100110… |
… | …111010111110001110100101 |
3 | 111021101122122221002010202212 |
4 | 113000331212322332032211 |
5 | 101231402030034000401 |
6 | 555140215331013205 |
7 | 30214664134313246 |
oct | 2700754672761645 |
9 | 437348587063685 |
10 | 101221221000101 |
11 | 2a285751471784 |
12 | b42942613a205 |
13 | 4463174073437 |
14 | 1add1c185accd |
15 | ba7ee250ddbb |
hex | 5c0f66ebe3a5 |
101221221000101 has 8 divisors (see below), whose sum is σ = 101479043561280. Its totient is φ = 100963475794368.
The previous prime is 101221221000091. The next prime is 101221221000139. The reversal of 101221221000101 is 101000122122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101221221000101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101221221000181) 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, 16718036 + ... + 21953021.
It is an arithmetic number, because the mean of its divisors is an integer number (12684880445160).
Almost surely, 2101221221000101 is an apocalyptic number.
It is an amenable number.
101221221000101 is a deficient number, since it is larger than the sum of its proper divisors (257822561179).
101221221000101 is an equidigital number, since it uses as much as digits as its factorization.
101221221000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38677723.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221221000101 its reverse (101000122122101), we get a palindrome (202221343122202).
The spelling of 101221221000101 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred twenty-one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •