Base | Representation |
---|---|
bin | 100000100001111… |
… | …0000110000000000 |
3 | 2211001212012120202 |
4 | 1001003300300000 |
5 | 4213411131102 |
6 | 300150424332 |
7 | 36022432523 |
oct | 10103606000 |
9 | 2731765522 |
10 | 1091505152 |
11 | 510142a81 |
12 | 2656620a8 |
13 | 14519824a |
14 | a4d6abba |
15 | 65c58e02 |
hex | 410f0c00 |
1091505152 has 44 divisors (see below), whose sum is σ = 2212823376. Its totient is φ = 538030080.
The previous prime is 1091505139. The next prime is 1091505187. The reversal of 1091505152 is 2515051901.
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, 65198 + ... + 80210.
Almost surely, 21091505152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1091505152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1106411688).
1091505152 is an abundant number, since it is smaller than the sum of its proper divisors (1121318224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1091505152 is an equidigital number, since it uses as much as digits as its factorization.
1091505152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15104 (or 15086 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 29.
The square root of 1091505152 is about 33037.9350444304. The cubic root of 1091505152 is about 1029.6159538468.
The spelling of 1091505152 in words is "one billion, ninety-one million, five hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •