Base | Representation |
---|---|
bin | 11001000011011000… |
… | …00110100101100101 |
3 | 1021201100202110010121 |
4 | 30201230012211211 |
5 | 210021212030313 |
6 | 10102350321541 |
7 | 654210026401 |
oct | 144154064545 |
9 | 37640673117 |
10 | 13450111333 |
11 | 578226779a |
12 | 27344b92b1 |
13 | 136470a279 |
14 | 918456101 |
15 | 53ac1328d |
hex | 321b06965 |
13450111333 has 8 divisors (see below), whose sum is σ = 13495135320. Its totient is φ = 13405163520.
The previous prime is 13450111313. The next prime is 13450111361. The reversal of 13450111333 is 33311105431.
It can be written as a sum of positive squares in 4 ways, for example, as 5027093604 + 8423017729 = 70902^2 + 91777^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13450111333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13450111298 and 13450111307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13450111303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 346291 + ... + 383167.
It is an arithmetic number, because the mean of its divisors is an integer number (1686891915).
Almost surely, 213450111333 is an apocalyptic number.
It is an amenable number.
13450111333 is a deficient number, since it is larger than the sum of its proper divisors (45023987).
13450111333 is an equidigital number, since it uses as much as digits as its factorization.
13450111333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38087.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 13450111333 its reverse (33311105431), we get a palindrome (46761216764).
The spelling of 13450111333 in words is "thirteen billion, four hundred fifty million, one hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •