Base | Representation |
---|---|
bin | 11000110011110111… |
… | …10011111001000010 |
3 | 1021101021221200110222 |
4 | 30121323303321002 |
5 | 204234410330310 |
6 | 10041422023042 |
7 | 651040141163 |
oct | 143173637102 |
9 | 37337850428 |
10 | 13320011330 |
11 | 571588772a |
12 | 26b8a17a82 |
13 | 1343788112 |
14 | 90506b76a |
15 | 52e5b5055 |
hex | 319ef3e42 |
13320011330 has 8 divisors (see below), whose sum is σ = 23976020412. Its totient is φ = 5328004528.
The previous prime is 13320011317. The next prime is 13320011339. The reversal of 13320011330 is 3311002331.
It can be written as a sum of positive squares in 2 ways, for example, as 13314159769 + 5851561 = 115387^2 + 2419^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 13320011299 and 13320011308.
It is not an unprimeable number, because it can be changed into a prime (13320011339) 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, 666000557 + ... + 666000576.
Almost surely, 213320011330 is an apocalyptic number.
13320011330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13320011330 is a deficient number, since it is larger than the sum of its proper divisors (10656009082).
13320011330 is a wasteful number, since it uses less digits than its factorization.
13320011330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332001140.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13320011330 its reverse (3311002331), we get a palindrome (16631013661).
It can be divided in two parts, 1332001 and 1330, that added together give a palindrome (1333331).
The spelling of 13320011330 in words is "thirteen billion, three hundred twenty million, eleven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •