Base | Representation |
---|---|
bin | 10110111111100000010001… |
… | …111100100111111101011011 |
3 | 111021001002000010111212220120 |
4 | 112333200101330213331123 |
5 | 101223231312321401021 |
6 | 555022203505324323 |
7 | 30204515631356256 |
oct | 2677402174477533 |
9 | 437032003455816 |
10 | 101121011122011 |
11 | 2a2471a8617111 |
12 | b411b1a0366a3 |
13 | 4456893c2b49a |
14 | 1ad83d69a609d |
15 | ba55c9b682c6 |
hex | 5bf811f27f5b |
101121011122011 has 16 divisors (see below), whose sum is σ = 148965990810624. Its totient is φ = 60689848106624.
The previous prime is 101121011121997. The next prime is 101121011122069. The reversal of 101121011122011 is 110221110121101.
It is a cyclic number.
It is not a de Polignac number, because 101121011122011 - 223 = 101121002733403 is a prime.
It is a super-2 number, since 2×1011210111220112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101121011122091) 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 15 ways as a sum of consecutive naturals, for example, 43103584131 + ... + 43103586476.
It is an arithmetic number, because the mean of its divisors is an integer number (9310374425664).
Almost surely, 2101121011122011 is an apocalyptic number.
101121011122011 is a deficient number, since it is larger than the sum of its proper divisors (47844979688613).
101121011122011 is a wasteful number, since it uses less digits than its factorization.
101121011122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86207170650.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101121011122011 its reverse (110221110121101), we get a palindrome (211342121243112).
The spelling of 101121011122011 in words is "one hundred one trillion, one hundred twenty-one billion, eleven million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •