Base | Representation |
---|---|
bin | 10110111111010111001010… |
… | …011010010110110100111011 |
3 | 111021000010201211201021110021 |
4 | 112333113022122112310323 |
5 | 101223101240040201021 |
6 | 555013504221431311 |
7 | 30204021213033544 |
oct | 2677271232266473 |
9 | 437003654637407 |
10 | 101111221022011 |
11 | 2a243034337082 |
12 | b41004740b537 |
13 | 44559938834c5 |
14 | 1ad7b486814cb |
15 | ba520541cc41 |
hex | 5bf5ca696d3b |
101111221022011 has 8 divisors (see below), whose sum is σ = 101481298789248. Its totient is φ = 100741215960000.
The previous prime is 101111221022003. The next prime is 101111221022029. The reversal of 101111221022011 is 110220122111101.
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 101111221022011 - 23 = 101111221022003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101111221022081) 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 7 ways as a sum of consecutive naturals, for example, 15389035 + ... + 20953396.
It is an arithmetic number, because the mean of its divisors is an integer number (12685162348656).
Almost surely, 2101111221022011 is an apocalyptic number.
101111221022011 is a deficient number, since it is larger than the sum of its proper divisors (370077767237).
101111221022011 is an equidigital number, since it uses as much as digits as its factorization.
101111221022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36352613.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101111221022011 its reverse (110220122111101), we get a palindrome (211331343133112).
The spelling of 101111221022011 in words is "one hundred one trillion, one hundred eleven billion, two hundred twenty-one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.787 sec. • engine limits •