Base | Representation |
---|---|
bin | 111000101010101100001… |
… | …101110101110001101011 |
3 | 111210021102121000011210110 |
4 | 320222230031311301223 |
5 | 1002300134144220332 |
6 | 12140534413345403 |
7 | 551225110063356 |
oct | 70525415656153 |
9 | 14707377004713 |
10 | 3894129679467 |
11 | 12715447588a5 |
12 | 52a860198263 |
13 | 2232a4055b61 |
14 | d66967c929d |
15 | 6b4667014cc |
hex | 38aac375c6b |
3894129679467 has 18 divisors (see below), whose sum is σ = 5233961503764. Its totient is φ = 2575357719480.
The previous prime is 3894129679439. The next prime is 3894129679469. The reversal of 3894129679467 is 7649769214983.
It is not a de Polignac number, because 3894129679467 - 27 = 3894129679339 is a prime.
It is a super-2 number, since 2×38941296794672 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3894129679469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 434075292 + ... + 434084262.
It is an arithmetic number, because the mean of its divisors is an integer number (290775639098).
Almost surely, 23894129679467 is an apocalyptic number.
3894129679467 is a deficient number, since it is larger than the sum of its proper divisors (1339831824297).
3894129679467 is an frugal number, since it uses more digits than its factorization.
3894129679467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18199 (or 9101 counting only the distinct ones).
The product of its digits is 987614208, while the sum is 75.
Multiplying 3894129679467 by its sum of digits (75), we get a square (292059725960025 = 170897552).
The spelling of 3894129679467 in words is "three trillion, eight hundred ninety-four billion, one hundred twenty-nine million, six hundred seventy-nine thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.905 sec. • engine limits •