Base | Representation |
---|---|
bin | 101111001011010111… |
… | …0111101100101111000 |
3 | 100200111200112211012201 |
4 | 1132112232331211320 |
5 | 3124442131003422 |
6 | 114313112115544 |
7 | 10214430330151 |
oct | 1362656754570 |
9 | 320450484181 |
10 | 101313141112 |
11 | 39a6a699497 |
12 | 17775695bb4 |
13 | 9727898c11 |
14 | 4c91602928 |
15 | 297e673727 |
hex | 1796bbd978 |
101313141112 has 16 divisors (see below), whose sum is σ = 201136383360. Its totient is φ = 47676772224.
The previous prime is 101313141101. The next prime is 101313141151. The reversal of 101313141112 is 211141313101.
It is a self number, because there is not a number n which added to its sum of digits gives 101313141112.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 372474648 + ... + 372474919.
It is an arithmetic number, because the mean of its divisors is an integer number (12571023960).
Almost surely, 2101313141112 is an apocalyptic number.
It is an amenable number.
101313141112 is a deficient number, since it is larger than the sum of its proper divisors (99823242248).
101313141112 is a wasteful number, since it uses less digits than its factorization.
101313141112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744949590 (or 744949586 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 101313141112 its reverse (211141313101), we get a palindrome (312454454213).
The spelling of 101313141112 in words is "one hundred one billion, three hundred thirteen million, one hundred forty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •