Base | Representation |
---|---|
bin | 111001010000000000011… |
… | …110110010000011111101 |
3 | 111221002212000211110210001 |
4 | 321100000132302003331 |
5 | 1003424214204100014 |
6 | 12211202355114301 |
7 | 554144045123410 |
oct | 71200036620375 |
9 | 14832760743701 |
10 | 3934198112509 |
11 | 12875362a7675 |
12 | 536582ba2991 |
13 | 226cbb348932 |
14 | d85b80cbb77 |
15 | 6c50e204974 |
hex | 394007b20fd |
3934198112509 has 8 divisors (see below), whose sum is σ = 4503218995520. Its totient is φ = 3366925374816.
The previous prime is 3934198112503. The next prime is 3934198112563. The reversal of 3934198112509 is 9052118914393.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3934198112509 - 23 = 3934198112501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3934198112509.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3934198112501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 437031504 + ... + 437040505.
It is an arithmetic number, because the mean of its divisors is an integer number (562902374440).
Almost surely, 23934198112509 is an apocalyptic number.
It is an amenable number.
3934198112509 is a deficient number, since it is larger than the sum of its proper divisors (569020883011).
3934198112509 is an equidigital number, since it uses as much as digits as its factorization.
3934198112509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874072659.
The product of its (nonzero) digits is 2099520, while the sum is 55.
The spelling of 3934198112509 in words is "three trillion, nine hundred thirty-four billion, one hundred ninety-eight million, one hundred twelve thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •