Base | Representation |
---|---|
bin | 101111001011010101… |
… | …1000111100010110101 |
3 | 100200111121122121202101 |
4 | 1132112223013202311 |
5 | 3124441401231201 |
6 | 114313034342101 |
7 | 10214415632011 |
oct | 1362653074265 |
9 | 320447577671 |
10 | 101312133301 |
11 | 39a6a070295 |
12 | 1777528a931 |
13 | 9727605292 |
14 | 4c9141d541 |
15 | 297e524d01 |
hex | 1796ac78b5 |
101312133301 has 8 divisors (see below), whose sum is σ = 107361609624. Its totient is φ = 95272650240.
The previous prime is 101312133227. The next prime is 101312133319. The reversal of 101312133301 is 103331213101.
It can be written as a sum of positive squares in 4 ways, for example, as 65458710801 + 35853422500 = 255849^2 + 189350^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101312133301 - 217 = 101312002229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101312133341) 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, 2477430 + ... + 2517991.
It is an arithmetic number, because the mean of its divisors is an integer number (13420201203).
Almost surely, 2101312133301 is an apocalyptic number.
It is an amenable number.
101312133301 is a deficient number, since it is larger than the sum of its proper divisors (6049476323).
101312133301 is a wasteful number, since it uses less digits than its factorization.
101312133301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4996631.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101312133301 its reverse (103331213101), we get a palindrome (204643346402).
The spelling of 101312133301 in words is "one hundred one billion, three hundred twelve million, one hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •