Base | Representation |
---|---|
bin | 10110111111100000010111… |
… | …110101110110110101001011 |
3 | 111021001002021000120222101112 |
4 | 112333200113311312311023 |
5 | 101223232013130324321 |
6 | 555022221401040535 |
7 | 30204521242044053 |
oct | 2677402765666513 |
9 | 437032230528345 |
10 | 101121110011211 |
11 | 2a24724941a024 |
12 | b411b4718614b |
13 | 44568ab5734c4 |
14 | 1ad8405b88563 |
15 | ba55d369da5b |
hex | 5bf817d76d4b |
101121110011211 has 4 divisors (see below), whose sum is σ = 101121146262312. Its totient is φ = 101121073760112.
The previous prime is 101121110011199. The next prime is 101121110011291. The reversal of 101121110011211 is 112110011121101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101121110011211 - 210 = 101121110010187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101121110011291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13557626 + ... + 19648191.
It is an arithmetic number, because the mean of its divisors is an integer number (25280286565578).
Almost surely, 2101121110011211 is an apocalyptic number.
101121110011211 is a deficient number, since it is larger than the sum of its proper divisors (36251101).
101121110011211 is an equidigital number, since it uses as much as digits as its factorization.
101121110011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36251100.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 101121110011211 its reverse (112110011121101), we get a palindrome (213231121132312).
The spelling of 101121110011211 in words is "one hundred one trillion, one hundred twenty-one billion, one hundred ten million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •