Base | Representation |
---|---|
bin | 1001010001111101000100… |
… | …1010101011010100011011 |
3 | 1100010111110020122210101122 |
4 | 2110133101022223110123 |
5 | 2314140401440040034 |
6 | 33411402345235455 |
7 | 2102135014464422 |
oct | 224372112532433 |
9 | 40114406583348 |
10 | 10204056565019 |
11 | 3284574a03599 |
12 | 1189745a92b8b |
13 | 590313a12715 |
14 | 273c43c8a2b9 |
15 | 12a66e5b262e |
hex | 947d12ab51b |
10204056565019 has 4 divisors (see below), whose sum is σ = 10214353293120. Its totient is φ = 10193759836920.
The previous prime is 10204056565009. The next prime is 10204056565033. The reversal of 10204056565019 is 91056565040201.
10204056565019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10204056565019 - 224 = 10204039787803 is a prime.
It is a super-2 number, since 2×102040565650192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10204056565009) 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, 5148362564 + ... + 5148364545.
It is an arithmetic number, because the mean of its divisors is an integer number (2553588323280).
Almost surely, 210204056565019 is an apocalyptic number.
10204056565019 is a deficient number, since it is larger than the sum of its proper divisors (10296728101).
10204056565019 is an equidigital number, since it uses as much as digits as its factorization.
10204056565019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10296728100.
The product of its (nonzero) digits is 324000, while the sum is 44.
The spelling of 10204056565019 in words is "ten trillion, two hundred four billion, fifty-six million, five hundred sixty-five thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.358 sec. • engine limits •