Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …110011100001001110011011 |
3 | 111020222002002021020212122111 |
4 | 112333030310303201032123 |
5 | 101222411022000214321 |
6 | 555004430543533151 |
7 | 30203146151205451 |
oct | 2677146463411633 |
9 | 436862067225574 |
10 | 101100121101211 |
11 | 2a239358761311 |
12 | b409a69bba1b7 |
13 | 445491504242b |
14 | 1ad73b44009d1 |
15 | ba4ca5be25e1 |
hex | 5bf334ce139b |
101100121101211 has 4 divisors (see below), whose sum is σ = 101354781356272. Its totient is φ = 100845460846152.
The previous prime is 101100121101179. The next prime is 101100121101247. The reversal of 101100121101211 is 112101121001101.
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 101100121101211 - 25 = 101100121101179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100121101191 and 101100121101200.
It is not an unprimeable number, because it can be changed into a prime (101100121101011) 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, 127330126935 + ... + 127330127728.
It is an arithmetic number, because the mean of its divisors is an integer number (25338695339068).
Almost surely, 2101100121101211 is an apocalyptic number.
101100121101211 is a deficient number, since it is larger than the sum of its proper divisors (254660255061).
101100121101211 is an equidigital number, since it uses as much as digits as its factorization.
101100121101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254660255060.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101100121101211 its reverse (112101121001101), we get a palindrome (213201242102312).
The spelling of 101100121101211 in words is "one hundred one trillion, one hundred billion, one hundred twenty-one million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •