Base | Representation |
---|---|
bin | 111100010010010… |
… | …000101111001101 |
3 | 2121111011110120001 |
4 | 330102100233031 |
5 | 4032410420414 |
6 | 244210124301 |
7 | 34030633450 |
oct | 7422205715 |
9 | 2544143501 |
10 | 1011420109 |
11 | 479a13997 |
12 | 242880691 |
13 | 13170824b |
14 | 98481497 |
15 | 5dbda074 |
hex | 3c490bcd |
1011420109 has 8 divisors (see below), whose sum is σ = 1156282560. Its totient is φ = 866651136.
The previous prime is 1011420097. The next prime is 1011420121. The reversal of 1011420109 is 9010241101.
1011420109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1011420097) and next prime (1011420121).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011420109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011420149) 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, 1602 + ... + 45004.
It is an arithmetic number, because the mean of its divisors is an integer number (144535320).
Almost surely, 21011420109 is an apocalyptic number.
It is an amenable number.
1011420109 is a deficient number, since it is larger than the sum of its proper divisors (144862451).
1011420109 is an equidigital number, since it uses as much as digits as its factorization.
1011420109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46739.
The product of its (nonzero) digits is 72, while the sum is 19.
The square root of 1011420109 is about 31802.8317764315. The cubic root of 1011420109 is about 1003.7923032563.
The spelling of 1011420109 in words is "one billion, eleven million, four hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •