Base | Representation |
---|---|
bin | 11000110100001110… |
… | …10111110101010011 |
3 | 1021101111122122221212 |
4 | 30122013113311103 |
5 | 204241144322011 |
6 | 10042011010335 |
7 | 651104663300 |
oct | 143207276523 |
9 | 37344578855 |
10 | 13323042131 |
11 | 5717567823 |
12 | 26b9a399ab |
13 | 13442a97a9 |
14 | 90561a0a7 |
15 | 52e9b308b |
hex | 31a1d7d53 |
13323042131 has 12 divisors (see below), whose sum is σ = 15502114440. Its totient is φ = 11416890240.
The previous prime is 13323042121. The next prime is 13323042133. The reversal of 13323042131 is 13124032331.
It is a de Polignac number, because none of the positive numbers 2k-13323042131 is a prime.
It is a super-2 number, since 2×133230421312 (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 = 13323042097 and 13323042106.
It is not an unprimeable number, because it can be changed into a prime (13323042133) 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 11 ways as a sum of consecutive naturals, for example, 176771 + ... + 240611.
It is an arithmetic number, because the mean of its divisors is an integer number (1291842870).
Almost surely, 213323042131 is an apocalyptic number.
13323042131 is a deficient number, since it is larger than the sum of its proper divisors (2179072309).
13323042131 is an equidigital number, since it uses as much as digits as its factorization.
13323042131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68114 (or 68107 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13323042131 its reverse (13124032331), we get a palindrome (26447074462).
The spelling of 13323042131 in words is "thirteen billion, three hundred twenty-three million, forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •