Base | Representation |
---|---|
bin | 1001000110011101001110… |
… | …00100001111111100010101 |
3 | 2121212020012020202201001210 |
4 | 10203032213010033330111 |
5 | 10110343214204303023 |
6 | 110321512031412033 |
7 | 4133616113212443 |
oct | 443164704177425 |
9 | 77766166681053 |
10 | 20013055541013 |
11 | 6416542128257 |
12 | 22b27b7984019 |
13 | b222b9030c32 |
14 | 4d28cc123b93 |
15 | 24a8bb109593 |
hex | 1233a710ff15 |
20013055541013 has 8 divisors (see below), whose sum is σ = 26704490336928. Its totient is φ = 13331828886224.
The previous prime is 20013055540999. The next prime is 20013055541093. The reversal of 20013055541013 is 31014555031002.
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 20013055541013 - 218 = 20013055278869 is a prime.
It is a super-2 number, since 2×200130555410132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013055541093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2552030706 + ... + 2552038547.
It is an arithmetic number, because the mean of its divisors is an integer number (3338061292116).
Almost surely, 220013055541013 is an apocalyptic number.
It is an amenable number.
20013055541013 is a deficient number, since it is larger than the sum of its proper divisors (6691434795915).
20013055541013 is a wasteful number, since it uses less digits than its factorization.
20013055541013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5104070563.
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 20013055541013 in words is "twenty trillion, thirteen billion, fifty-five million, five hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •