Base | Representation |
---|---|
bin | 11000010001100100… |
… | …10100101000100011 |
3 | 1020122020121000021110 |
4 | 30020302110220203 |
5 | 203142232430311 |
6 | 5553103354403 |
7 | 640644550524 |
oct | 141062245043 |
9 | 36566530243 |
10 | 13032311331 |
11 | 5588444436 |
12 | 26385b2a03 |
13 | 12c8ca5a30 |
14 | 8b8b7a84b |
15 | 5141d58a6 |
hex | 308c94a23 |
13032311331 has 8 divisors (see below), whose sum is σ = 18713062480. Its totient is φ = 8019883872.
The previous prime is 13032311321. The next prime is 13032311381. The reversal of 13032311331 is 13311323031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13032311331 - 218 = 13032049187 is a prime.
It is a super-2 number, since 2×130323113312 (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 = 13032311298 and 13032311307.
It is not an unprimeable number, because it can be changed into a prime (13032311311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167080876 + ... + 167080953.
It is an arithmetic number, because the mean of its divisors is an integer number (2339132810).
Almost surely, 213032311331 is an apocalyptic number.
13032311331 is a deficient number, since it is larger than the sum of its proper divisors (5680751149).
13032311331 is a wasteful number, since it uses less digits than its factorization.
13032311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334161845.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13032311331 its reverse (13311323031), we get a palindrome (26343634362).
The spelling of 13032311331 in words is "thirteen billion, thirty-two million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •