Base | Representation |
---|---|
bin | 10100111000111101… |
… | …10001100001011010 |
3 | 1001221121110121020012 |
4 | 22130132301201122 |
5 | 140432100404300 |
6 | 5052513401522 |
7 | 544632013301 |
oct | 123436614132 |
9 | 31847417205 |
10 | 11215247450 |
11 | 4835795450 |
12 | 220bb692a2 |
13 | 10996bcac4 |
14 | 785701438 |
15 | 45990b435 |
hex | 29c7b185a |
11215247450 has 48 divisors (see below), whose sum is σ = 22779390240. Its totient is φ = 4074216000.
The previous prime is 11215247447. The next prime is 11215247473. The reversal of 11215247450 is 5474251211.
11215247450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×112152474503 (a number of 31 digits) contains 333 as substring.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 573941 + ... + 593159.
It is an arithmetic number, because the mean of its divisors is an integer number (474570630).
Almost surely, 211215247450 is an apocalyptic number.
11215247450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11215247450 is an abundant number, since it is smaller than the sum of its proper divisors (11564142790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11215247450 is a wasteful number, since it uses less digits than its factorization.
11215247450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20303 (or 20298 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 32.
Adding to 11215247450 its reverse (5474251211), we get a palindrome (16689498661).
The spelling of 11215247450 in words is "eleven billion, two hundred fifteen million, two hundred forty-seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •