Base | Representation |
---|---|
bin | 10001111110011111… |
… | …101001010110110101 |
3 | 1211211012021222120001 |
4 | 101332133221112311 |
5 | 304012314004021 |
6 | 12511154511301 |
7 | 1252216044202 |
oct | 217637512665 |
9 | 54735258501 |
10 | 19302094261 |
11 | 820559011a |
12 | 38a8295531 |
13 | 1a87c1c868 |
14 | d11734ca9 |
15 | 77e85e091 |
hex | 47e7e95b5 |
19302094261 has 4 divisors (see below), whose sum is σ = 19449438624. Its totient is φ = 19154749900.
The previous prime is 19302094249. The next prime is 19302094271. The reversal of 19302094261 is 16249020391.
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 a cyclic number.
It is not a de Polignac number, because 19302094261 - 233 = 10712159669 is a prime.
It is a super-3 number, since 3×193020942613 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 19302094261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19302094271) 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, 73671985 + ... + 73672246.
It is an arithmetic number, because the mean of its divisors is an integer number (4862359656).
Almost surely, 219302094261 is an apocalyptic number.
It is an amenable number.
19302094261 is a deficient number, since it is larger than the sum of its proper divisors (147344363).
19302094261 is a wasteful number, since it uses less digits than its factorization.
19302094261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147344362.
The product of its (nonzero) digits is 23328, while the sum is 37.
The spelling of 19302094261 in words is "nineteen billion, three hundred two million, ninety-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •