Base | Representation |
---|---|
bin | 111000111001010… |
… | …1001000111100101 |
3 | 11221001022101021112 |
4 | 1301302221013211 |
5 | 12402212213104 |
6 | 513234354405 |
7 | 65211043133 |
oct | 16162510745 |
9 | 4831271245 |
10 | 1909101029 |
11 | 89a701950 |
12 | 45342ba05 |
13 | 24569c1a4 |
14 | 141796753 |
15 | b290986e |
hex | 71ca91e5 |
1909101029 has 4 divisors (see below), whose sum is σ = 2082655680. Its totient is φ = 1735546380.
The previous prime is 1909100989. The next prime is 1909101041. The reversal of 1909101029 is 9201019091.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9201019091 = 11 ⋅836456281.
It is a cyclic number.
It is not a de Polignac number, because 1909101029 - 28 = 1909100773 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1909100986 and 1909101004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1909101529) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 86777309 + ... + 86777330.
It is an arithmetic number, because the mean of its divisors is an integer number (520663920).
Almost surely, 21909101029 is an apocalyptic number.
It is an amenable number.
1909101029 is a deficient number, since it is larger than the sum of its proper divisors (173554651).
1909101029 is a wasteful number, since it uses less digits than its factorization.
1909101029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173554650.
The product of its (nonzero) digits is 1458, while the sum is 32.
The square root of 1909101029 is about 43693.2606817115. The cubic root of 1909101029 is about 1240.5367579517.
The spelling of 1909101029 in words is "one billion, nine hundred nine million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •