Base | Representation |
---|---|
bin | 1100000110110000011110… |
… | …1101100001001011101011 |
3 | 1202010110001000122222220021 |
4 | 3001230013231201023223 |
5 | 3221033324123220321 |
6 | 44150345302541311 |
7 | 2542426660652665 |
oct | 301540755411353 |
9 | 52113030588807 |
10 | 13310233023211 |
11 | 42719245a9873 |
12 | 15ab742137837 |
13 | 7571c3851837 |
14 | 34030c227535 |
15 | 18136a3d2941 |
hex | c1b07b612eb |
13310233023211 has 8 divisors (see below), whose sum is σ = 14014708390400. Its totient is φ = 12606151334760.
The previous prime is 13310233023209. The next prime is 13310233023233. The reversal of 13310233023211 is 11232033201331.
13310233023211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13310233023211 - 21 = 13310233023209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13310233023511) 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, 98350275 + ... + 98485516.
It is an arithmetic number, because the mean of its divisors is an integer number (1751838548800).
Almost surely, 213310233023211 is an apocalyptic number.
13310233023211 is a deficient number, since it is larger than the sum of its proper divisors (704475367189).
13310233023211 is a wasteful number, since it uses less digits than its factorization.
13310233023211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196839369.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13310233023211 its reverse (11232033201331), we get a palindrome (24542266224542).
The spelling of 13310233023211 in words is "thirteen trillion, three hundred ten billion, two hundred thirty-three million, twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •