Base | Representation |
---|---|
bin | 1100000001100000011101… |
… | …0011111101110001000011 |
3 | 1201210211012202112211022111 |
4 | 3000120013103331301003 |
5 | 3213044111143330311 |
6 | 44041110542120151 |
7 | 2533054501005655 |
oct | 300300723756103 |
9 | 51724182484274 |
10 | 13220032011331 |
11 | 4237647474562 |
12 | 1596169b80057 |
13 | 74b84a1ac822 |
14 | 339bd27626d5 |
15 | 17dd3b59bd21 |
hex | c06074fdc43 |
13220032011331 has 8 divisors (see below), whose sum is σ = 13998026802240. Its totient is φ = 12442075648128.
The previous prime is 13220032011323. The next prime is 13220032011371. The reversal of 13220032011331 is 13311023002231.
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 13220032011331 - 23 = 13220032011323 is a prime.
It is a super-3 number, since 3×132200320113313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13220032011371) 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, 8897136 + ... + 10276141.
It is an arithmetic number, because the mean of its divisors is an integer number (1749753350280).
Almost surely, 213220032011331 is an apocalyptic number.
13220032011331 is a deficient number, since it is larger than the sum of its proper divisors (777994790909).
13220032011331 is a wasteful number, since it uses less digits than its factorization.
13220032011331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19213853.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13220032011331 its reverse (13311023002231), we get a palindrome (26531055013562).
The spelling of 13220032011331 in words is "thirteen trillion, two hundred twenty billion, thirty-two million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •