Base | Representation |
---|---|
bin | 1001000111000100100010… |
… | …10000100100000001110101 |
3 | 2121221020200101000021022021 |
4 | 10203202101100210001311 |
5 | 10111214432103203431 |
6 | 110335322414033141 |
7 | 4135264162363540 |
oct | 443422120440165 |
9 | 77836611007267 |
10 | 20034164506741 |
11 | 6424494635680 |
12 | 22b69091a87b1 |
13 | b242a13a83b8 |
14 | 4d39317dd857 |
15 | 24b2043ccb11 |
hex | 123891424075 |
20034164506741 has 32 divisors (see below), whose sum is σ = 25668619312896. Its totient is φ = 15181620480000.
The previous prime is 20034164506709. The next prime is 20034164506831. The reversal of 20034164506741 is 14760546143002.
It is a cyclic number.
It is not a de Polignac number, because 20034164506741 - 25 = 20034164506709 is a prime.
It is a super-3 number, since 3×200341645067413 (a number of 41 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20034164504741) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9149160 + ... + 11125441.
It is an arithmetic number, because the mean of its divisors is an integer number (802144353528).
Almost surely, 220034164506741 is an apocalyptic number.
It is an amenable number.
20034164506741 is a deficient number, since it is larger than the sum of its proper divisors (5634454806155).
20034164506741 is a wasteful number, since it uses less digits than its factorization.
20034164506741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20274973.
The product of its (nonzero) digits is 483840, while the sum is 43.
The spelling of 20034164506741 in words is "twenty trillion, thirty-four billion, one hundred sixty-four million, five hundred six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •