Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …110011100000111101010000 |
3 | 111020222002002021020211010210 |
4 | 112333030310303200331100 |
5 | 101222411022000200422 |
6 | 555004430543524120 |
7 | 30203146151202321 |
oct | 2677146463407520 |
9 | 436862067224123 |
10 | 101100121100112 |
11 | 2a239358760502 |
12 | b409a69bb9640 |
13 | 4454915041a94 |
14 | 1ad73b4400448 |
15 | ba4ca5be210c |
hex | 5bf334ce0f50 |
101100121100112 has 20 divisors (see below), whose sum is σ = 261175312842080. Its totient is φ = 33700040366688.
The previous prime is 101100121100057. The next prime is 101100121100131. The reversal of 101100121100112 is 211001121001101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1053126261412 + ... + 1053126261507.
It is an arithmetic number, because the mean of its divisors is an integer number (13058765642104).
Almost surely, 2101100121100112 is an apocalyptic number.
101100121100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101100121100112 is an abundant number, since it is smaller than the sum of its proper divisors (160075191741968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100121100112 is a wasteful number, since it uses less digits than its factorization.
101100121100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106252522930 (or 2106252522924 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101100121100112 its reverse (211001121001101), we get a palindrome (312101242101213).
The spelling of 101100121100112 in words is "one hundred one trillion, one hundred billion, one hundred twenty-one million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •