Base | Representation |
---|---|
bin | 11000110010101101… |
… | …11000010111011011 |
3 | 1021100121201211122110 |
4 | 30121112320113123 |
5 | 204224421032311 |
6 | 10040434323403 |
7 | 650561640534 |
oct | 143126702733 |
9 | 37317654573 |
10 | 13310330331 |
11 | 5710375201 |
12 | 26b5729563 |
13 | 134177880c |
14 | 903a6b68b |
15 | 52d8018a6 |
hex | 3195b85db |
13310330331 has 8 divisors (see below), whose sum is σ = 17778190144. Its totient is φ = 8858012040.
The previous prime is 13310330317. The next prime is 13310330351. The reversal of 13310330331 is 13303301331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13310330331 - 225 = 13276775899 is a prime.
It is a super-2 number, since 2×133103303312 (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 = 13310330298 and 13310330307.
It is not an unprimeable number, because it can be changed into a prime (13310330351) 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 7 ways as a sum of consecutive naturals, for example, 3883381 + ... + 3886806.
It is an arithmetic number, because the mean of its divisors is an integer number (2222273768).
Almost surely, 213310330331 is an apocalyptic number.
13310330331 is a deficient number, since it is larger than the sum of its proper divisors (4467859813).
13310330331 is an equidigital number, since it uses as much as digits as its factorization.
13310330331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7770761.
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 13310330331 its reverse (13303301331), we get a palindrome (26613631662).
The spelling of 13310330331 in words is "thirteen billion, three hundred ten million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •