Base | Representation |
---|---|
bin | 100000110010010… |
… | …1010111100110111 |
3 | 2211200002111121020 |
4 | 1001210222330313 |
5 | 4223113212101 |
6 | 301055352223 |
7 | 36155653236 |
oct | 10144527467 |
9 | 2750074536 |
10 | 1100132151 |
11 | 514aa5628 |
12 | 268522673 |
13 | 146bc8b91 |
14 | a6174b1d |
15 | 668b0136 |
hex | 4192af37 |
1100132151 has 8 divisors (see below), whose sum is σ = 1475842560. Its totient is φ = 728921592.
The previous prime is 1100132147. The next prime is 1100132153. The reversal of 1100132151 is 1512310011.
1100132151 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100132151 - 22 = 1100132147 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100132151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100132153) 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, 1124391 + ... + 1125368.
It is an arithmetic number, because the mean of its divisors is an integer number (184480320).
Almost surely, 21100132151 is an apocalyptic number.
1100132151 is a deficient number, since it is larger than the sum of its proper divisors (375710409).
1100132151 is a wasteful number, since it uses less digits than its factorization.
1100132151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2249925.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 1100132151 is about 33168.2400950065. The cubic root of 1100132151 is about 1032.3214522403.
Adding to 1100132151 its reverse (1512310011), we get a palindrome (2612442162).
The spelling of 1100132151 in words is "one billion, one hundred million, one hundred thirty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •