Base | Representation |
---|---|
bin | 100001000111000… |
… | …1111111010000110 |
3 | 2212102121020121020 |
4 | 1002032033322012 |
5 | 4233411001210 |
6 | 302125132010 |
7 | 36350416455 |
oct | 10216177206 |
9 | 2772536536 |
10 | 1111031430 |
11 | 52016a3a3 |
12 | 2700ba006 |
13 | 149243b62 |
14 | a77b0b9c |
15 | 67814770 |
hex | 4238fe86 |
1111031430 has 128 divisors (see below), whose sum is σ = 2915813376. Its totient is φ = 269875200.
The previous prime is 1111031429. The next prime is 1111031473. The reversal of 1111031430 is 341301111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2208559 + ... + 2209061.
It is an arithmetic number, because the mean of its divisors is an integer number (22779792).
Almost surely, 21111031430 is an apocalyptic number.
1111031430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1111031430, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1457906688).
1111031430 is an abundant number, since it is smaller than the sum of its proper divisors (1804781946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111031430 is a wasteful number, since it uses less digits than its factorization.
1111031430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1111031430 is about 33332.1380952378. The cubic root of 1111031430 is about 1035.7194092856.
Adding to 1111031430 its reverse (341301111), we get a palindrome (1452332541).
The spelling of 1111031430 in words is "one billion, one hundred eleven million, thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •