Base | Representation |
---|---|
bin | 10100111000010111… |
… | …01000110100111101 |
3 | 1001221021000202002111 |
4 | 22130023220310331 |
5 | 140424304343401 |
6 | 5052214054021 |
7 | 544541251336 |
oct | 123413506475 |
9 | 31837022074 |
10 | 11210231101 |
11 | 4832979603 |
12 | 220a34a311 |
13 | 1098654754 |
14 | 784b9728d |
15 | 459269e51 |
hex | 29c2e8d3d |
11210231101 has 4 divisors (see below), whose sum is σ = 11216671804. Its totient is φ = 11203790400.
The previous prime is 11210231089. The next prime is 11210231143. The reversal of 11210231101 is 10113201211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10113201211 = 313 ⋅32310547.
It can be written as a sum of positive squares in 2 ways, for example, as 1209231076 + 10001000025 = 34774^2 + 100005^2 .
It is a cyclic number.
It is not a de Polignac number, because 11210231101 - 27 = 11210230973 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 (11210238101) 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, 3217740 + ... + 3221221.
It is an arithmetic number, because the mean of its divisors is an integer number (2804167951).
Almost surely, 211210231101 is an apocalyptic number.
It is an amenable number.
11210231101 is a deficient number, since it is larger than the sum of its proper divisors (6440703).
11210231101 is an equidigital number, since it uses as much as digits as its factorization.
11210231101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6440702.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11210231101 its reverse (10113201211), we get a palindrome (21323432312).
The spelling of 11210231101 in words is "eleven billion, two hundred ten million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •