Base | Representation |
---|---|
bin | 100001001011010… |
… | …0001111011111100 |
3 | 2212120200112122120 |
4 | 1002112201323330 |
5 | 4234434434203 |
6 | 302243442540 |
7 | 36405031062 |
oct | 10226417374 |
9 | 2776615576 |
10 | 1113202428 |
11 | 521412508 |
12 | 270986450 |
13 | 149824080 |
14 | a7bb8032 |
15 | 67ae2b53 |
hex | 425a1efc |
1113202428 has 24 divisors (see below), whose sum is σ = 2797278288. Its totient is φ = 342523776.
The previous prime is 1113202423. The next prime is 1113202429. The reversal of 1113202428 is 8242023111.
1113202428 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 1113202398 and 1113202407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113202421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3567801 + ... + 3568112.
It is an arithmetic number, because the mean of its divisors is an integer number (116553262).
Almost surely, 21113202428 is an apocalyptic number.
It is an amenable number.
1113202428 is an abundant number, since it is smaller than the sum of its proper divisors (1684075860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113202428 is a wasteful number, since it uses less digits than its factorization.
1113202428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7135933 (or 7135931 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 1113202428 is about 33364.6883396204. The cubic root of 1113202428 is about 1036.3935821644.
Adding to 1113202428 its reverse (8242023111), we get a palindrome (9355225539).
The spelling of 1113202428 in words is "one billion, one hundred thirteen million, two hundred two thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •