Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …111010100000110011111000 |
3 | 111021000010110020120221110102 |
4 | 112333113003322200303320 |
5 | 101223101024133323000 |
6 | 555013445325134532 |
7 | 30204015420331310 |
oct | 2677270372406370 |
9 | 437003406527412 |
10 | 101111112011000 |
11 | 2a242a88850533 |
12 | b4100169ba448 |
13 | 4455977106350 |
14 | 1ad7b37dc6440 |
15 | ba51eaa883d5 |
hex | 5bf5c3ea0cf8 |
101111112011000 has 128 divisors (see below), whose sum is σ = 291200002853760. Its totient is φ = 32000000256000.
The previous prime is 101111112010967. The next prime is 101111112011003. The reversal of 101111112011000 is 110211111101.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111112011003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 555464561 + ... + 555646560.
It is an arithmetic number, because the mean of its divisors is an integer number (2275000022295).
Almost surely, 2101111112011000 is an apocalyptic number.
101111112011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101111112011000 is an abundant number, since it is smaller than the sum of its proper divisors (190088890842760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111112011000 is a wasteful number, since it uses less digits than its factorization.
101111112011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111111162 (or 1111111148 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101111112011000 its reverse (110211111101), we get a palindrome (101221323122101).
The spelling of 101111112011000 in words is "one hundred one trillion, one hundred eleven billion, one hundred twelve million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •