Base | Representation |
---|---|
bin | 1111100111101110… |
… | …0001011101100101 |
3 | 101211020010002110202 |
4 | 3321323201131211 |
5 | 32041420132331 |
6 | 1532025200245 |
7 | 205624006541 |
oct | 37173413545 |
9 | 11736102422 |
10 | 4193130341 |
11 | 1861a04984 |
12 | 990330085 |
13 | 51a941c1a |
14 | 2bac68a21 |
15 | 1981c3ecb |
hex | f9ee1765 |
4193130341 has 4 divisors (see below), whose sum is σ = 4199112684. Its totient is φ = 4187148000.
The previous prime is 4193130317. The next prime is 4193130353. The reversal of 4193130341 is 1430313914.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3439353316 + 753777025 = 58646^2 + 27455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4193130341 is a prime.
It is a super-2 number, since 2×41931303412 = 35164684113229552562, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4193130371) 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, 2990120 + ... + 2991521.
It is an arithmetic number, because the mean of its divisors is an integer number (1049778171).
Almost surely, 24193130341 is an apocalyptic number.
It is an amenable number.
4193130341 is a deficient number, since it is larger than the sum of its proper divisors (5982343).
4193130341 is an equidigital number, since it uses as much as digits as its factorization.
4193130341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5982342.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 4193130341 is about 64754.3847241251. The cubic root of 4193130341 is about 1612.5485068917.
The spelling of 4193130341 in words is "four billion, one hundred ninety-three million, one hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •