Base | Representation |
---|---|
bin | 11001001111010101… |
… | …01011001101001011 |
3 | 1021222100110122202221 |
4 | 30213222223031023 |
5 | 210222400302311 |
6 | 10120332034511 |
7 | 656535334216 |
oct | 144752531513 |
9 | 37870418687 |
10 | 13550400331 |
11 | 5823936366 |
12 | 2762002a37 |
13 | 137c422480 |
14 | 9278c077d |
15 | 544923671 |
hex | 327aab34b |
13550400331 has 4 divisors (see below), whose sum is σ = 14592738832. Its totient is φ = 12508061832.
The previous prime is 13550400317. The next prime is 13550400337. The reversal of 13550400331 is 13300405531.
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 13550400331 - 213 = 13550392139 is a prime.
It is a super-2 number, since 2×135504003312 (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 = 13550400296 and 13550400305.
It is not an unprimeable number, because it can be changed into a prime (13550400337) 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, 521169231 + ... + 521169256.
It is an arithmetic number, because the mean of its divisors is an integer number (3648184708).
Almost surely, 213550400331 is an apocalyptic number.
13550400331 is a deficient number, since it is larger than the sum of its proper divisors (1042338501).
13550400331 is a wasteful number, since it uses less digits than its factorization.
13550400331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042338500.
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 13550400331 its reverse (13300405531), we get a palindrome (26850805862).
The spelling of 13550400331 in words is "thirteen billion, five hundred fifty million, four hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •