Base | Representation |
---|---|
bin | 1000111001010110001… |
… | …11000001101110111101 |
3 | 1002012222101101121211001 |
4 | 10130223013001232331 |
5 | 20002000440043123 |
6 | 352230533530301 |
7 | 31040454424141 |
oct | 4345307015675 |
9 | 1065871347731 |
10 | 305665940413 |
11 | 1086a5500189 |
12 | 4b2a6aa3991 |
13 | 22a93932b82 |
14 | 10b19833221 |
15 | 7e3ed0b0ad |
hex | 472b1c1bbd |
305665940413 has 4 divisors (see below), whose sum is σ = 306648789408. Its totient is φ = 304683091420.
The previous prime is 305665940407. The next prime is 305665940417. The reversal of 305665940413 is 314049566503.
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, and also an emirpimes, since its reverse is a distinct semiprime: 314049566503 = 809 ⋅388194767.
It is a cyclic number.
It is not a de Polignac number, because 305665940413 - 217 = 305665809341 is a prime.
It is a super-2 number, since 2×3056659404132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305665940417) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 491424031 + ... + 491424652.
It is an arithmetic number, because the mean of its divisors is an integer number (76662197352).
Almost surely, 2305665940413 is an apocalyptic number.
It is an amenable number.
305665940413 is a deficient number, since it is larger than the sum of its proper divisors (982848995).
305665940413 is an equidigital number, since it uses as much as digits as its factorization.
305665940413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982848994.
The product of its (nonzero) digits is 1166400, while the sum is 46.
The spelling of 305665940413 in words is "three hundred five billion, six hundred sixty-five million, nine hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •