Base | Representation |
---|---|
bin | 10100101101000001… |
… | …10010001101010100 |
3 | 1001200122001011012010 |
4 | 22112200302031110 |
5 | 140230432030002 |
6 | 5034535224220 |
7 | 542304613110 |
oct | 122640621524 |
9 | 31618034163 |
10 | 11115111252 |
11 | 4794210663 |
12 | 21a2518070 |
13 | 1081a2c30b |
14 | 7762b6740 |
15 | 450c2b46c |
hex | 296832354 |
11115111252 has 48 divisors (see below), whose sum is σ = 29647336320. Its totient is φ = 3174991872.
The previous prime is 11115111251. The next prime is 11115111253. The reversal of 11115111252 is 25211151111.
It is an interprime number because it is at equal distance from previous prime (11115111251) and next prime (11115111253).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11115111251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 407548 + ... + 433964.
It is an arithmetic number, because the mean of its divisors is an integer number (617652840).
Almost surely, 211115111252 is an apocalyptic number.
11115111252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11115111252 is an abundant number, since it is smaller than the sum of its proper divisors (18532225068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11115111252 is a wasteful number, since it uses less digits than its factorization.
11115111252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31440 (or 31438 counting only the distinct ones).
The product of its digits is 100, while the sum is 21.
Adding to 11115111252 its reverse (25211151111), we get a palindrome (36326262363).
The spelling of 11115111252 in words is "eleven billion, one hundred fifteen million, one hundred eleven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •