Base | Representation |
---|---|
bin | 101111001011010011… |
… | …1101011000010110101 |
3 | 100200111112221201211201 |
4 | 1132112213223002311 |
5 | 3124441133331013 |
6 | 114313003132501 |
7 | 10214405150611 |
oct | 1362647530265 |
9 | 320445851751 |
10 | 101311230133 |
11 | 39a69603773 |
12 | 17774b14131 |
13 | 972737a169 |
14 | 4c91266341 |
15 | 297e3e73dd |
hex | 17969eb0b5 |
101311230133 has 8 divisors (see below), whose sum is σ = 109244459520. Its totient is φ = 93638106720.
The previous prime is 101311230103. The next prime is 101311230161. The reversal of 101311230133 is 331032113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101311230133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101311230133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101311230103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65025685 + ... + 65027242.
It is an arithmetic number, because the mean of its divisors is an integer number (13655557440).
Almost surely, 2101311230133 is an apocalyptic number.
It is an amenable number.
101311230133 is a deficient number, since it is larger than the sum of its proper divisors (7933229387).
101311230133 is a wasteful number, since it uses less digits than its factorization.
101311230133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130052987.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101311230133 its reverse (331032113101), we get a palindrome (432343343234).
The spelling of 101311230133 in words is "one hundred one billion, three hundred eleven million, two hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •