Base | Representation |
---|---|
bin | 11000110001101111… |
… | …10111101111110011 |
3 | 1021100001102211202101 |
4 | 30120313313233303 |
5 | 204220330420311 |
6 | 10035544201231 |
7 | 650432563036 |
oct | 143067675763 |
9 | 37301384671 |
10 | 13302201331 |
11 | 5706822821 |
12 | 26b2a69217 |
13 | 133cb90763 |
14 | 90295301d |
15 | 52cc47ec1 |
hex | 318df7bf3 |
13302201331 has 4 divisors (see below), whose sum is σ = 13391478000. Its totient is φ = 13212924664.
The previous prime is 13302201323. The next prime is 13302201337. The reversal of 13302201331 is 13310220331.
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 13302201331 - 23 = 13302201323 is a prime.
It is a super-2 number, since 2×133022013312 (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 = 13302201299 and 13302201308.
It is not an unprimeable number, because it can be changed into a prime (13302201337) 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 3 ways as a sum of consecutive naturals, for example, 44638111 + ... + 44638408.
It is an arithmetic number, because the mean of its divisors is an integer number (3347869500).
Almost surely, 213302201331 is an apocalyptic number.
13302201331 is a deficient number, since it is larger than the sum of its proper divisors (89276669).
13302201331 is an equidigital number, since it uses as much as digits as its factorization.
13302201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89276668.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13302201331 its reverse (13310220331), we get a palindrome (26612421662).
The spelling of 13302201331 in words is "thirteen billion, three hundred two million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •