Base | Representation |
---|---|
bin | 1000111011000010111010… |
… | …01011010000110101100001 |
3 | 2120110202011101212200200001 |
4 | 10131201131023100311201 |
5 | 10032432223300414021 |
6 | 105421430112100001 |
7 | 4063366010600365 |
oct | 435413513206541 |
9 | 76422141780601 |
10 | 19620973841761 |
11 | 6285232241466 |
12 | 224a814534601 |
13 | ac433302c066 |
14 | 4bb93583d2a5 |
15 | 2405be96e091 |
hex | 11d85d2d0d61 |
19620973841761 has 8 divisors (see below), whose sum is σ = 20529847298304. Its totient is φ = 18716749355040.
The previous prime is 19620973841747. The next prime is 19620973841797. The reversal of 19620973841761 is 16714837902691.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 19620973841761 - 27 = 19620973841633 is a prime.
It is a super-2 number, since 2×196209738417612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19620973841693 and 19620973841702.
It is not an unprimeable number, because it can be changed into a prime (19620973841561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1162233820 + ... + 1162250701.
It is an arithmetic number, because the mean of its divisors is an integer number (2566230912288).
Almost surely, 219620973841761 is an apocalyptic number.
It is an amenable number.
19620973841761 is a deficient number, since it is larger than the sum of its proper divisors (908873456543).
19620973841761 is a wasteful number, since it uses less digits than its factorization.
19620973841761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2324484911.
The product of its (nonzero) digits is 27433728, while the sum is 64.
The spelling of 19620973841761 in words is "nineteen trillion, six hundred twenty billion, nine hundred seventy-three million, eight hundred forty-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •