Base | Representation |
---|---|
bin | 10100100100001001… |
… | …00100100000101100 |
3 | 1001111102211220112200 |
4 | 22102010210200230 |
5 | 140102343400002 |
6 | 5023314301500 |
7 | 540411414264 |
oct | 122204444054 |
9 | 31442756480 |
10 | 11040606252 |
11 | 4756152985 |
12 | 2181587890 |
13 | 106c474110 |
14 | 76a4407a4 |
15 | 449410b1c |
hex | 29212482c |
11040606252 has 144 divisors (see below), whose sum is σ = 30987919872. Its totient is φ = 3293055360.
The previous prime is 11040606151. The next prime is 11040606277. The reversal of 11040606252 is 25260604011.
11040606252 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 0 + 606 + 2 + 52 = 666.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 2351227 + ... + 2355917.
It is an arithmetic number, because the mean of its divisors is an integer number (215193888).
Almost surely, 211040606252 is an apocalyptic number.
11040606252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11040606252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15493959936).
11040606252 is an abundant number, since it is smaller than the sum of its proper divisors (19947313620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11040606252 is a wasteful number, since it uses less digits than its factorization.
11040606252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4868 (or 4863 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 11040606252 in words is "eleven billion, forty million, six hundred six thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •