Base | Representation |
---|---|
bin | 10110111111100001010100… |
… | …000111010001110010000011 |
3 | 111021001011212111100020201222 |
4 | 112333201110013101302003 |
5 | 101223241101012223021 |
6 | 555022510002345255 |
7 | 30204555301102325 |
oct | 2677412407216203 |
9 | 437034774306658 |
10 | 101122121211011 |
11 | 2a2477181a243a |
12 | b41218995b22b |
13 | 4456a0cc02394 |
14 | 1ad84a01ad615 |
15 | ba56423436ab |
hex | 5bf8541d1c83 |
101122121211011 has 8 divisors (see below), whose sum is σ = 101151129315600. Its totient is φ = 101093114304000.
The previous prime is 101122121210989. The next prime is 101122121211047. The reversal of 101122121211011 is 110112121221101.
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-101122121211011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101122121211211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184932011 + ... + 185478011.
It is an arithmetic number, because the mean of its divisors is an integer number (12643891164450).
Almost surely, 2101122121211011 is an apocalyptic number.
101122121211011 is a deficient number, since it is larger than the sum of its proper divisors (29008104589).
101122121211011 is an equidigital number, since it uses as much as digits as its factorization.
101122121211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598789.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101122121211011 its reverse (110112121221101), we get a palindrome (211234242432112).
The spelling of 101122121211011 in words is "one hundred one trillion, one hundred twenty-two billion, one hundred twenty-one million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •