Base | Representation |
---|---|
bin | 100000111100100… |
… | …1010010000010100 |
3 | 2212001012101100220 |
4 | 1001321022100110 |
5 | 4231002101002 |
6 | 301410434340 |
7 | 36252423360 |
oct | 10171122024 |
9 | 2761171326 |
10 | 1105503252 |
11 | 518033a57 |
12 | 26a2929b0 |
13 | 148059849 |
14 | a6b722a0 |
15 | 670c17bc |
hex | 41e4a414 |
1105503252 has 48 divisors (see below), whose sum is σ = 2950872960. Its totient is φ = 315551232.
The previous prime is 1105503241. The next prime is 1105503253. The reversal of 1105503252 is 2523055011.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105503253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89008 + ... + 100664.
It is an arithmetic number, because the mean of its divisors is an integer number (61476520).
Almost surely, 21105503252 is an apocalyptic number.
1105503252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1105503252 is an abundant number, since it is smaller than the sum of its proper divisors (1845369708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105503252 is a wasteful number, since it uses less digits than its factorization.
1105503252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12800 (or 12798 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 1105503252 is about 33249.1090406946. The cubic root of 1105503252 is about 1033.9987366967.
Adding to 1105503252 its reverse (2523055011), we get a palindrome (3628558263).
The spelling of 1105503252 in words is "one billion, one hundred five million, five hundred three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •