Base | Representation |
---|---|
bin | 100000110100000… |
… | …0110001011110100 |
3 | 2211201210010101210 |
4 | 1001220012023310 |
5 | 4223330431012 |
6 | 301130521420 |
7 | 36166413246 |
oct | 10150061364 |
9 | 2751703353 |
10 | 1101030132 |
11 | 515559264 |
12 | 268896270 |
13 | 147151827 |
14 | a632a096 |
15 | 669db23c |
hex | 41a062f4 |
1101030132 has 12 divisors (see below), whose sum is σ = 2569070336. Its totient is φ = 367010040.
The previous prime is 1101030121. The next prime is 1101030169. The reversal of 1101030132 is 2310301011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 91752511 = 1101030132 / (1 + 1 + 0 + 1 + 0 + 3 + 0 + 1 + 3 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45876244 + ... + 45876267.
Almost surely, 21101030132 is an apocalyptic number.
1101030132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1101030132 is an abundant number, since it is smaller than the sum of its proper divisors (1468040204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101030132 is a wasteful number, since it uses less digits than its factorization.
1101030132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91752518 (or 91752516 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1101030132 is about 33181.7740936195. The cubic root of 1101030132 is about 1032.6022527306.
Adding to 1101030132 its reverse (2310301011), we get a palindrome (3411331143).
The spelling of 1101030132 in words is "one billion, one hundred one million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •