Base | Representation |
---|---|
bin | 10100111101010111… |
… | …11100001011110110 |
3 | 1002001012002200220001 |
4 | 22132223330023312 |
5 | 141021034102210 |
6 | 5100314501514 |
7 | 545561401405 |
oct | 123653741366 |
9 | 32035080801 |
10 | 11252253430 |
11 | 4854670600 |
12 | 222043489a |
13 | 10a4278932 |
14 | 78a5b563c |
15 | 45ccbb03a |
hex | 29eafc2f6 |
11252253430 has 48 divisors (see below), whose sum is σ = 23230724832. Its totient is φ = 3913817600.
The previous prime is 11252253401. The next prime is 11252253443. The reversal of 11252253430 is 3435225211.
It is a super-3 number, since 3×112522534303 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 174331 + ... + 229990.
It is an arithmetic number, because the mean of its divisors is an integer number (483973434).
Almost surely, 211252253430 is an apocalyptic number.
11252253430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11252253430 is an abundant number, since it is smaller than the sum of its proper divisors (11978471402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11252253430 is a wasteful number, since it uses less digits than its factorization.
11252253430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404373 (or 404362 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 11252253430 its reverse (3435225211), we get a palindrome (14687478641).
The spelling of 11252253430 in words is "eleven billion, two hundred fifty-two million, two hundred fifty-three thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •