Base | Representation |
---|---|
bin | 1011111010100001010011… |
… | …1000010010010000111111 |
3 | 1201101100101120011220201121 |
4 | 2332220110320102100333 |
5 | 3204112300120130444 |
6 | 43510020203251411 |
7 | 2521305140306254 |
oct | 276502470222077 |
9 | 51340346156647 |
10 | 13100000551999 |
11 | 41a0751882599 |
12 | 1576a4b819b67 |
13 | 74042b62c18a |
14 | 33408718b42b |
15 | 17ab63980084 |
hex | bea14e1243f |
13100000551999 has 8 divisors (see below), whose sum is σ = 13322198791440. Its totient is φ = 12877807790400.
The previous prime is 13100000551987. The next prime is 13100000552029. The reversal of 13100000551999 is 99915500000131.
13100000551999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13100000551999 - 225 = 13099966997567 is a prime.
It is a super-2 number, since 2×131000005519992 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100000551909) 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, 3606019 + ... + 6261259.
It is an arithmetic number, because the mean of its divisors is an integer number (1665274848930).
Almost surely, 213100000551999 is an apocalyptic number.
13100000551999 is a deficient number, since it is larger than the sum of its proper divisors (222198239441).
13100000551999 is an equidigital number, since it uses as much as digits as its factorization.
13100000551999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2738921.
The product of its (nonzero) digits is 54675, while the sum is 43.
The spelling of 13100000551999 in words is "thirteen trillion, one hundred billion, five hundred fifty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •