Base | Representation |
---|---|
bin | 10100100011100101… |
… | …11000101001100111 |
3 | 1001111010010101000020 |
4 | 22101302320221213 |
5 | 140100202021101 |
6 | 5023031050223 |
7 | 540324125043 |
oct | 122162705147 |
9 | 31433111006 |
10 | 11035970151 |
11 | 4753576798 |
12 | 217bb10973 |
13 | 106b50cb6b |
14 | 769995023 |
15 | 448ce7136 |
hex | 291cb8a67 |
11035970151 has 4 divisors (see below), whose sum is σ = 14714626872. Its totient is φ = 7357313432.
The previous prime is 11035970149. The next prime is 11035970161. The reversal of 11035970151 is 15107953011.
It is a happy number.
11035970151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15107953011 = 3 ⋅5035984337.
It is a cyclic number.
It is not a de Polignac number, because 11035970151 - 21 = 11035970149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11035970161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1839328356 + ... + 1839328361.
It is an arithmetic number, because the mean of its divisors is an integer number (3678656718).
Almost surely, 211035970151 is an apocalyptic number.
11035970151 is a deficient number, since it is larger than the sum of its proper divisors (3678656721).
11035970151 is an equidigital number, since it uses as much as digits as its factorization.
11035970151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3678656720.
The product of its (nonzero) digits is 4725, while the sum is 33.
The spelling of 11035970151 in words is "eleven billion, thirty-five million, nine hundred seventy thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •