Base | Representation |
---|---|
bin | 10101010101001111… |
… | …10011000111001000 |
3 | 1002120010212222200211 |
4 | 22222213303013020 |
5 | 141423314304110 |
6 | 5132230410504 |
7 | 553542411103 |
oct | 125247630710 |
9 | 32503788624 |
10 | 11452494280 |
11 | 49476a8507 |
12 | 2277500a34 |
13 | 11068b8746 |
14 | 7a901b73a |
15 | 47067198a |
hex | 2aa9f31c8 |
11452494280 has 32 divisors (see below), whose sum is σ = 25782724800. Its totient is φ = 4578399936.
The previous prime is 11452494271. The next prime is 11452494281. The reversal of 11452494280 is 8249425411.
11452494280 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (11452494281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8970 + ... + 151609.
It is an arithmetic number, because the mean of its divisors is an integer number (805710150).
Almost surely, 211452494280 is an apocalyptic number.
11452494280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11452494280 is an abundant number, since it is smaller than the sum of its proper divisors (14330230520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11452494280 is a wasteful number, since it uses less digits than its factorization.
11452494280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162373 (or 162369 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 40.
The spelling of 11452494280 in words is "eleven billion, four hundred fifty-two million, four hundred ninety-four thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •