Base | Representation |
---|---|
bin | 11000011101010111… |
… | …00011011000001011 |
3 | 1020220010200002001011 |
4 | 30032223203120023 |
5 | 203343041400021 |
6 | 10010555104351 |
7 | 643255233646 |
oct | 141653433013 |
9 | 36803602034 |
10 | 13131200011 |
11 | 5629246a16 |
12 | 26657420b7 |
13 | 131361a747 |
14 | 8c7d5ca5d |
15 | 51cc1ade1 |
hex | 30eae360b |
13131200011 has 8 divisors (see below), whose sum is σ = 13477215024. Its totient is φ = 12786410880.
The previous prime is 13131199933. The next prime is 13131200021. The reversal of 13131200011 is 11000213131.
13131200011 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 not a de Polignac number, because 13131200011 - 221 = 13129102859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13131199964 and 13131200000.
It is not an unprimeable number, because it can be changed into a prime (13131200021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 284746 + ... + 327631.
It is an arithmetic number, because the mean of its divisors is an integer number (1684651878).
Almost surely, 213131200011 is an apocalyptic number.
13131200011 is a deficient number, since it is larger than the sum of its proper divisors (346015013).
13131200011 is an equidigital number, since it uses as much as digits as its factorization.
13131200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612941.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13131200011 its reverse (11000213131), we get a palindrome (24131413142).
The spelling of 13131200011 in words is "thirteen billion, one hundred thirty-one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •