Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …010100101111101000000100 |
3 | 111021000010102112221221010120 |
4 | 112333113003110233220010 |
5 | 101223101014120011322 |
6 | 555013444333021540 |
7 | 30204015240224115 |
oct | 2677270324575004 |
9 | 437003375857116 |
10 | 101111102110212 |
11 | 2a242a831a8967 |
12 | b4100136248b0 |
13 | 445597504a9ac |
14 | 1ad7b3696a20c |
15 | ba51e9c7ea5c |
hex | 5bf5c352fa04 |
101111102110212 has 48 divisors (see below), whose sum is σ = 249866305520832. Its totient is φ = 31713205478400.
The previous prime is 101111102110153. The next prime is 101111102110261. The reversal of 101111102110212 is 212011201111101.
It is a junction number, because it is equal to n+sod(n) for n = 101111102110191 and 101111102110200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61092289 + ... + 62725512.
It is an arithmetic number, because the mean of its divisors is an integer number (5205548031684).
Almost surely, 2101111102110212 is an apocalyptic number.
101111102110212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101111102110212 is an abundant number, since it is smaller than the sum of its proper divisors (148755203410620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111102110212 is a wasteful number, since it uses less digits than its factorization.
101111102110212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123821828 (or 123821826 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101111102110212 its reverse (212011201111101), we get a palindrome (313122303221313).
The spelling of 101111102110212 in words is "one hundred one trillion, one hundred eleven billion, one hundred two million, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •