Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100010101010011011011 |
3 | 111020222011100112002122020002 |
4 | 112333031221030111103123 |
5 | 101222414322001134321 |
6 | 555005054102123215 |
7 | 30203210012666441 |
oct | 2677155114252333 |
9 | 436864315078202 |
10 | 101101000021211 |
11 | 2a2397698a5983 |
12 | b40a07442050b |
13 | 4454a25167c38 |
14 | 1ad7459030b91 |
15 | ba4d07e5820b |
hex | 5bf3693154db |
101101000021211 has 4 divisors (see below), whose sum is σ = 101109284963352. Its totient is φ = 101092715079072.
The previous prime is 101101000021183. The next prime is 101101000021267. The reversal of 101101000021211 is 112120000101101.
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 101101000021211 - 210 = 101101000020187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101101000021192 and 101101000021201.
It is not an unprimeable number, because it can be changed into a prime (101101000021291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4142452766 + ... + 4142477171.
It is an arithmetic number, because the mean of its divisors is an integer number (25277321240838).
Almost surely, 2101101000021211 is an apocalyptic number.
101101000021211 is a deficient number, since it is larger than the sum of its proper divisors (8284942141).
101101000021211 is an equidigital number, since it uses as much as digits as its factorization.
101101000021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8284942140.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101101000021211 its reverse (112120000101101), we get a palindrome (213221000122312).
The spelling of 101101000021211 in words is "one hundred one trillion, one hundred one billion, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •