Base | Representation |
---|---|
bin | 10110111111010111001010… |
… | …011110111100000010100011 |
3 | 111021000010201220222021220202 |
4 | 112333113022132330002203 |
5 | 101223101240342114021 |
6 | 555013504303255415 |
7 | 30204021226165160 |
oct | 2677271236740243 |
9 | 437003656867822 |
10 | 101111222223011 |
11 | 2a243034a87440 |
12 | b4100478aa56b |
13 | 4455993bb4060 |
14 | 1ad7b488b5067 |
15 | ba52055a8a0b |
hex | 5bf5ca7bc0a3 |
101111222223011 has 64 divisors (see below), whose sum is σ = 141751544417280. Its totient is φ = 69563253634560.
The previous prime is 101111222223001. The next prime is 101111222223031. The reversal of 101111222223011 is 110322222111101.
It is a de Polignac number, because none of the positive numbers 2k-101111222223011 is a prime.
It is a super-2 number, since 2×1011112222230112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101111222223001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13170116 + ... + 19382321.
It is an arithmetic number, because the mean of its divisors is an integer number (2214867881520).
Almost surely, 2101111222223011 is an apocalyptic number.
101111222223011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101111222223011 is a deficient number, since it is larger than the sum of its proper divisors (40640322194269).
101111222223011 is a wasteful number, since it uses less digits than its factorization.
101111222223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32552604.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 101111222223011 its reverse (110322222111101), we get a palindrome (211433444334112).
The spelling of 101111222223011 in words is "one hundred one trillion, one hundred eleven billion, two hundred twenty-two million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •