Base | Representation |
---|---|
bin | 10100101111010011… |
… | …01101111001010101 |
3 | 1001201222000111022122 |
4 | 22113221231321111 |
5 | 140300330330401 |
6 | 5040501105325 |
7 | 542626252151 |
oct | 122751557125 |
9 | 31658014278 |
10 | 11134230101 |
11 | 47a3a89965 |
12 | 21a89b8245 |
13 | 1085994647 |
14 | 778a52061 |
15 | 45275621b |
hex | 297a6de55 |
11134230101 has 8 divisors (see below), whose sum is σ = 11647589400. Its totient is φ = 10629498880.
The previous prime is 11134230097. The next prime is 11134230167. The reversal of 11134230101 is 10103243111.
It can be written as a sum of positive squares in 4 ways, for example, as 510805201 + 10623424900 = 22601^2 + 103070^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 11134230101 - 22 = 11134230097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11134230101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11134232101) 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, 2154380 + ... + 2159541.
It is an arithmetic number, because the mean of its divisors is an integer number (1455948675).
Almost surely, 211134230101 is an apocalyptic number.
It is an amenable number.
11134230101 is a deficient number, since it is larger than the sum of its proper divisors (513359299).
11134230101 is an equidigital number, since it uses as much as digits as its factorization.
11134230101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4314039.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11134230101 its reverse (10103243111), we get a palindrome (21237473212).
The spelling of 11134230101 in words is "eleven billion, one hundred thirty-four million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •