Base | Representation |
---|---|
bin | 101111001011111001… |
… | …1100001100110011101 |
3 | 100200112221100221220221 |
4 | 1132113303201212131 |
5 | 3130011231130042 |
6 | 114314553241341 |
7 | 10215036155332 |
oct | 1362763414635 |
9 | 320487327827 |
10 | 101331114397 |
11 | 39a79855047 |
12 | 1777b703251 |
13 | 972b51c9b6 |
14 | 4c93b60989 |
15 | 2981023d67 |
hex | 1797ce199d |
101331114397 has 4 divisors (see below), whose sum is σ = 102060115360. Its totient is φ = 100602113436.
The previous prime is 101331114323. The next prime is 101331114403. The reversal of 101331114397 is 793411133101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 793411133101 = 151213 ⋅5246977.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101331114397 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 (101331114197) 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, 364500273 + ... + 364500550.
It is an arithmetic number, because the mean of its divisors is an integer number (25515028840).
Almost surely, 2101331114397 is an apocalyptic number.
It is an amenable number.
101331114397 is a deficient number, since it is larger than the sum of its proper divisors (729000963).
101331114397 is an equidigital number, since it uses as much as digits as its factorization.
101331114397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 729000962.
The product of its (nonzero) digits is 6804, while the sum is 34.
Adding to 101331114397 its reverse (793411133101), we get a palindrome (894742247498).
The spelling of 101331114397 in words is "one hundred one billion, three hundred thirty-one million, one hundred fourteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •