Base | Representation |
---|---|
bin | 11110100011010010110… |
… | …11000011011111101101 |
3 | 10201100120020100210221222 |
4 | 33101221123003133231 |
5 | 114144332111020414 |
6 | 2122124430433125 |
7 | 135561360616514 |
oct | 17215133033755 |
9 | 3640506323858 |
10 | 1049740720109 |
11 | 3752132a7144 |
12 | 14b5440627a5 |
13 | 77cb43c6cc3 |
14 | 38b4456367b |
15 | 1c48d49268e |
hex | f4696c37ed |
1049740720109 has 8 divisors (see below), whose sum is σ = 1056917223648. Its totient is φ = 1042582882320.
The previous prime is 1049740720099. The next prime is 1049740720117. The reversal of 1049740720109 is 9010270479401.
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-1049740720109 is a prime.
It is a super-2 number, since 2×10497407201092 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1049740720109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1049740720129) 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, 4553567 + ... + 4778540.
It is an arithmetic number, because the mean of its divisors is an integer number (132114652956).
Almost surely, 21049740720109 is an apocalyptic number.
It is an amenable number.
1049740720109 is a deficient number, since it is larger than the sum of its proper divisors (7176503539).
1049740720109 is an equidigital number, since it uses as much as digits as its factorization.
1049740720109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9332875.
The product of its (nonzero) digits is 127008, while the sum is 44.
The spelling of 1049740720109 in words is "one trillion, forty-nine billion, seven hundred forty million, seven hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.237 sec. • engine limits •