Base | Representation |
---|---|
bin | 101111000011000001… |
… | …0110001000111100111 |
3 | 100122210011122021202222 |
4 | 1132012002301013213 |
5 | 3123403434321411 |
6 | 114225230222555 |
7 | 10204460231561 |
oct | 1360602610747 |
9 | 318704567688 |
10 | 101033120231 |
11 | 3993662067a |
12 | 176b7954a5b |
13 | 96b1874ba4 |
14 | 4c66350331 |
15 | 2964cae4db |
hex | 17860b11e7 |
101033120231 has 4 divisors (see below), whose sum is σ = 101137602192. Its totient is φ = 100928638272.
The previous prime is 101033120219. The next prime is 101033120249. The reversal of 101033120231 is 132021330101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132021330101 = 32987 ⋅4002223.
It is a cyclic number.
It is not a de Polignac number, because 101033120231 - 222 = 101028925927 is a prime.
It is a super-2 number, since 2×1010331202312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101033120261) 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, 52239530 + ... + 52241463.
It is an arithmetic number, because the mean of its divisors is an integer number (25284400548).
Almost surely, 2101033120231 is an apocalyptic number.
101033120231 is a deficient number, since it is larger than the sum of its proper divisors (104481961).
101033120231 is an equidigital number, since it uses as much as digits as its factorization.
101033120231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104481960.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101033120231 its reverse (132021330101), we get a palindrome (233054450332).
The spelling of 101033120231 in words is "one hundred one billion, thirty-three million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •