Base | Representation |
---|---|
bin | 111001000001010110110… |
… | …101111010001010011001 |
3 | 111212121020201020121002101 |
4 | 321001112311322022121 |
5 | 1003200010042141033 |
6 | 12200041410003401 |
7 | 553046161121422 |
oct | 71012665721231 |
9 | 14777221217071 |
10 | 3918467146393 |
11 | 12808a3605a28 |
12 | 533512876561 |
13 | 22568223a867 |
14 | d7924b8c649 |
15 | 6bddd15297d |
hex | 39056d7a299 |
3918467146393 has 2 divisors, whose sum is σ = 3918467146394. Its totient is φ = 3918467146392.
The previous prime is 3918467146387. The next prime is 3918467146397. The reversal of 3918467146393 is 3936417648193.
3918467146393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3817131247504 + 101335898889 = 1953748^2 + 318333^2 .
It is a cyclic number.
It is not a de Polignac number, because 3918467146393 - 241 = 1719443890841 is a prime.
It is a super-2 number, since 2×39184671463932 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3918467146397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1959233573196 + 1959233573197.
It is an arithmetic number, because the mean of its divisors is an integer number (1959233573197).
Almost surely, 23918467146393 is an apocalyptic number.
It is an amenable number.
3918467146393 is a deficient number, since it is larger than the sum of its proper divisors (1).
3918467146393 is an equidigital number, since it uses as much as digits as its factorization.
3918467146393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 70543872, while the sum is 64.
The spelling of 3918467146393 in words is "three trillion, nine hundred eighteen billion, four hundred sixty-seven million, one hundred forty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •