Base | Representation |
---|---|
bin | 10110111111100001011000… |
… | …111011100000011001001011 |
3 | 111021001012002010101022202222 |
4 | 112333201120323200121023 |
5 | 101223241232203324321 |
6 | 555022522010244255 |
7 | 30204560301640403 |
oct | 2677413073403113 |
9 | 437035063338688 |
10 | 101122202011211 |
11 | 2a24775986a867 |
12 | b4121b0a2668b |
13 | 4456a23882a54 |
14 | 1ad84aac03803 |
15 | ba56494a43ab |
hex | 5bf858ee064b |
101122202011211 has 4 divisors (see below), whose sum is σ = 101122274185752. Its totient is φ = 101122129836672.
The previous prime is 101122202011087. The next prime is 101122202011219. The reversal of 101122202011211 is 112110202221101.
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 101122202011211 - 246 = 30753457833547 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101122202011211.
It is not an unprimeable number, because it can be changed into a prime (101122202011219) 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, 33943190 + ... + 36801963.
It is an arithmetic number, because the mean of its divisors is an integer number (25280568546438).
Almost surely, 2101122202011211 is an apocalyptic number.
101122202011211 is a deficient number, since it is larger than the sum of its proper divisors (72174541).
101122202011211 is an equidigital number, since it uses as much as digits as its factorization.
101122202011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72174540.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101122202011211 its reverse (112110202221101), we get a palindrome (213232404232312).
The spelling of 101122202011211 in words is "one hundred one trillion, one hundred twenty-two billion, two hundred two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •