Base | Representation |
---|---|
bin | 1011011101100111101… |
… | …01000000011011000001 |
3 | 1101122121201021022212110 |
4 | 11232303311000123001 |
5 | 22423110403302321 |
6 | 500534130045533 |
7 | 40312123416231 |
oct | 5566365003301 |
9 | 1348551238773 |
10 | 393859040961 |
11 | 142042184a41 |
12 | 643ba7198a9 |
13 | 2b1aa2ba879 |
14 | 150c477dcc1 |
15 | a3a271a176 |
hex | 5bb3d406c1 |
393859040961 has 4 divisors (see below), whose sum is σ = 525145387952. Its totient is φ = 262572693972.
The previous prime is 393859040959. The next prime is 393859040963. The reversal of 393859040961 is 169040958393.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (393859040959) and next prime (393859040963).
It is not a de Polignac number, because 393859040961 - 21 = 393859040959 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (393859040963) 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 3 ways as a sum of consecutive naturals, for example, 65643173491 + ... + 65643173496.
It is an arithmetic number, because the mean of its divisors is an integer number (131286346988).
Almost surely, 2393859040961 is an apocalyptic number.
It is an amenable number.
393859040961 is a deficient number, since it is larger than the sum of its proper divisors (131286346991).
393859040961 is a wasteful number, since it uses less digits than its factorization.
393859040961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131286346990.
The product of its (nonzero) digits is 6298560, while the sum is 57.
The spelling of 393859040961 in words is "three hundred ninety-three billion, eight hundred fifty-nine million, forty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •