Base | Representation |
---|---|
bin | 101011110101100101101000… |
… | …0010010100111110110111111 |
3 | 1212120021201102200112021021221 |
4 | 1113223023100102213312333 |
5 | 401020110244010134241 |
6 | 3444032503042134211 |
7 | 144135316550445442 |
oct | 12753132022476677 |
9 | 1776251380467257 |
10 | 385597068443071 |
11 | 1019548867065a1 |
12 | 372b7366051367 |
13 | 13720855819204 |
14 | 6b30dd7949659 |
15 | 2e8a3e82b25d1 |
hex | 15eb2d04a7dbf |
385597068443071 has 2 divisors, whose sum is σ = 385597068443072. Its totient is φ = 385597068443070.
The previous prime is 385597068443063. The next prime is 385597068443087. The reversal of 385597068443071 is 170344860795583.
It is a weak prime.
It is an emirp because it is prime and its reverse (170344860795583) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 385597068443071 - 23 = 385597068443063 is a prime.
It is a super-2 number, since 2×3855970684430712 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (385597065443071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 192798534221535 + 192798534221536.
It is an arithmetic number, because the mean of its divisors is an integer number (192798534221536).
Almost surely, 2385597068443071 is an apocalyptic number.
385597068443071 is a deficient number, since it is larger than the sum of its proper divisors (1).
385597068443071 is an equidigital number, since it uses as much as digits as its factorization.
385597068443071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 609638400, while the sum is 70.
The spelling of 385597068443071 in words is "three hundred eighty-five trillion, five hundred ninety-seven billion, sixty-eight million, four hundred forty-three thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •