Base | Representation |
---|---|
bin | 10110111111011000000000… |
… | …000011111101100011110101 |
3 | 111021000020001120102001011100 |
4 | 112333120000003331203311 |
5 | 101223110111001333023 |
6 | 555014133414000313 |
7 | 30204052422534102 |
oct | 2677300003754365 |
9 | 437006046361140 |
10 | 101112121121013 |
11 | 2a243456426852 |
12 | b410258946099 |
13 | 4455aa81b2c72 |
14 | 1ad7bd2025aa9 |
15 | ba5259468c43 |
hex | 5bf6000fd8f5 |
101112121121013 has 24 divisors (see below), whose sum is σ = 149232478801536. Its totient is φ = 65941059211200.
The previous prime is 101112121120963. The next prime is 101112121121027. The reversal of 101112121121013 is 310121121211101.
It is not a de Polignac number, because 101112121121013 - 217 = 101112120989941 is a prime.
It is a super-2 number, since 2×1011121211210132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101112121121083) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58581408 + ... + 60282713.
It is an arithmetic number, because the mean of its divisors is an integer number (6218019950064).
Almost surely, 2101112121121013 is an apocalyptic number.
It is an amenable number.
101112121121013 is a deficient number, since it is larger than the sum of its proper divisors (48120357680523).
101112121121013 is a wasteful number, since it uses less digits than its factorization.
101112121121013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118866185 (or 118866182 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 18.
Adding to 101112121121013 its reverse (310121121211101), we get a palindrome (411233242332114).
The spelling of 101112121121013 in words is "one hundred one trillion, one hundred twelve billion, one hundred twenty-one million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •