Base | Representation |
---|---|
bin | 10110111111010111111001… |
… | …100100001000000010001011 |
3 | 111021000012202222021210220220 |
4 | 112333113321210020002023 |
5 | 101223104400100041021 |
6 | 555014114521321123 |
7 | 30204046630140435 |
oct | 2677277144100213 |
9 | 437005688253826 |
10 | 101112012112011 |
11 | 2a2433aa94176a |
12 | b4102283361a3 |
13 | 4455a8b7369b4 |
14 | 1ad7bc176b655 |
15 | ba524ead4cc6 |
hex | 5bf5f990808b |
101112012112011 has 8 divisors (see below), whose sum is σ = 134974065409680. Its totient is φ = 67328983444512.
The previous prime is 101112012112009. The next prime is 101112012112021. The reversal of 101112012112011 is 110211210211101.
101112012112011 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101112012112011 - 21 = 101112012112009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101112012112021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19756154556 + ... + 19756159673.
It is an arithmetic number, because the mean of its divisors is an integer number (16871758176210).
Almost surely, 2101112012112011 is an apocalyptic number.
101112012112011 is a deficient number, since it is larger than the sum of its proper divisors (33862053297669).
101112012112011 is an equidigital number, since it uses as much as digits as its factorization.
101112012112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39512315085.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101112012112011 its reverse (110211210211101), we get a palindrome (211323222323112).
The spelling of 101112012112011 in words is "one hundred one trillion, one hundred twelve billion, twelve million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •