Base | Representation |
---|---|
bin | 100001101001100… |
… | …1001101001001101 |
3 | 2220200120220101112 |
4 | 1003103021221031 |
5 | 4303021444314 |
6 | 304012221405 |
7 | 36660065252 |
oct | 10323115115 |
9 | 2820526345 |
10 | 1129093709 |
11 | 52a3868a7 |
12 | 27616a865 |
13 | 14cbc92b3 |
14 | a9d53429 |
15 | 691d143e |
hex | 434c9a4d |
1129093709 has 4 divisors (see below), whose sum is σ = 1195511004. Its totient is φ = 1062676416.
The previous prime is 1129093703. The next prime is 1129093723. The reversal of 1129093709 is 9073909211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9073909211 = 19 ⋅477574169.
It can be written as a sum of positive squares in 2 ways, for example, as 394141609 + 734952100 = 19853^2 + 27110^2 .
It is a cyclic number.
It is not a de Polignac number, because 1129093709 - 224 = 1112316493 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1129093703) 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, 33208622 + ... + 33208655.
It is an arithmetic number, because the mean of its divisors is an integer number (298877751).
Almost surely, 21129093709 is an apocalyptic number.
It is an amenable number.
1129093709 is a deficient number, since it is larger than the sum of its proper divisors (66417295).
1129093709 is an equidigital number, since it uses as much as digits as its factorization.
1129093709 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66417294.
The product of its (nonzero) digits is 30618, while the sum is 41.
The square root of 1129093709 is about 33601.9896583521. The cubic root of 1129093709 is about 1041.3019041345.
The spelling of 1129093709 in words is "one billion, one hundred twenty-nine million, ninety-three thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •