Base | Representation |
---|---|
bin | 11000001101110000… |
… | …10101001011111111 |
3 | 1020120000102021220221 |
4 | 30012320111023333 |
5 | 203111041111111 |
6 | 5550002122211 |
7 | 640105666441 |
oct | 140670251377 |
9 | 36500367827 |
10 | 13000332031 |
11 | 5571391965 |
12 | 2629950367 |
13 | 12c2489b7b |
14 | 8b4814491 |
15 | 5114ba371 |
hex | 306e152ff |
13000332031 has 4 divisors (see below), whose sum is σ = 13000635000. Its totient is φ = 13000029064.
The previous prime is 13000331923. The next prime is 13000332041. The reversal of 13000332031 is 13023300031.
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 13000332031 - 211 = 13000329983 is a prime.
It is a super-2 number, since 2×130003320312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13000331996 and 13000332014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000332041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73861 + ... + 177358.
It is an arithmetic number, because the mean of its divisors is an integer number (3250158750).
Almost surely, 213000332031 is an apocalyptic number.
13000332031 is a deficient number, since it is larger than the sum of its proper divisors (302969).
13000332031 is an equidigital number, since it uses as much as digits as its factorization.
13000332031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302968.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 13000332031 its reverse (13023300031), we get a palindrome (26023632062).
The spelling of 13000332031 in words is "thirteen billion, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •