Base | Representation |
---|---|
bin | 101111001011111000… |
… | …0011101100000111111 |
3 | 100200112212212011012001 |
4 | 1132113300131200333 |
5 | 3130011024424411 |
6 | 114314524123131 |
7 | 10215026301622 |
oct | 1362760354077 |
9 | 320485764161 |
10 | 101330311231 |
11 | 39a79356676 |
12 | 1777b3964a7 |
13 | 972b2cb256 |
14 | 4c939d1db9 |
15 | 2980e15dc1 |
hex | 1797c1d83f |
101330311231 has 4 divisors (see below), whose sum is σ = 107290917792. Its totient is φ = 95369704672.
The previous prime is 101330311207. The next prime is 101330311237. The reversal of 101330311231 is 132113033101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101330311231 is a prime.
It is a super-2 number, since 2×1013303112312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101330311199 and 101330311208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101330311237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2980303255 + ... + 2980303288.
It is an arithmetic number, because the mean of its divisors is an integer number (26822729448).
Almost surely, 2101330311231 is an apocalyptic number.
101330311231 is a deficient number, since it is larger than the sum of its proper divisors (5960606561).
101330311231 is an equidigital number, since it uses as much as digits as its factorization.
101330311231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5960606560.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101330311231 its reverse (132113033101), we get a palindrome (233443344332).
The spelling of 101330311231 in words is "one hundred one billion, three hundred thirty million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •