Base | Representation |
---|---|
bin | 11000110110011011… |
… | …00001001000111101 |
3 | 1021102210020212211101 |
4 | 30123031201020331 |
5 | 204310401232313 |
6 | 10043505053101 |
7 | 651420200230 |
oct | 143315411075 |
9 | 37383225741 |
10 | 13341430333 |
11 | 5726987090 |
12 | 2704027191 |
13 | 134804739a |
14 | 907c45417 |
15 | 5313e65dd |
hex | 31b36123d |
13341430333 has 8 divisors (see below), whose sum is σ = 16633471680. Its totient is φ = 10395919680.
The previous prime is 13341430273. The next prime is 13341430337. The reversal of 13341430333 is 33303414331.
13341430333 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 a cyclic number.
It is not a de Polignac number, because 13341430333 - 217 = 13341299261 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13341430337) 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, 86632588 + ... + 86632741.
It is an arithmetic number, because the mean of its divisors is an integer number (2079183960).
Almost surely, 213341430333 is an apocalyptic number.
It is an amenable number.
13341430333 is a deficient number, since it is larger than the sum of its proper divisors (3292041347).
13341430333 is a wasteful number, since it uses less digits than its factorization.
13341430333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173265347.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 13341430333 its reverse (33303414331), we get a palindrome (46644844664).
The spelling of 13341430333 in words is "thirteen billion, three hundred forty-one million, four hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •