Base | Representation |
---|---|
bin | 11000101001001010… |
… | …01101110010011011 |
3 | 1021011000221220020220 |
4 | 30110211031302123 |
5 | 204043412431021 |
6 | 10024453051123 |
7 | 645566601345 |
oct | 142445156233 |
9 | 37130856226 |
10 | 13230202011 |
11 | 567a116654 |
12 | 2692926aa3 |
13 | 132aca1c00 |
14 | 8d7170295 |
15 | 526774cc6 |
hex | 31494dc9b |
13230202011 has 12 divisors (see below), whose sum is σ = 19101594168. Its totient is φ = 8141662464.
The previous prime is 13230202003. The next prime is 13230202019. The reversal of 13230202011 is 11020203231.
13230202011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13230202003) and next prime (13230202019).
It is not a de Polignac number, because 13230202011 - 23 = 13230202003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13230202019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13047030 + ... + 13048043.
It is an arithmetic number, because the mean of its divisors is an integer number (1591799514).
Almost surely, 213230202011 is an apocalyptic number.
13230202011 is a deficient number, since it is larger than the sum of its proper divisors (5871392157).
13230202011 is a wasteful number, since it uses less digits than its factorization.
13230202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26095102 (or 26095089 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 13230202011 its reverse (11020203231), we get a palindrome (24250405242).
The spelling of 13230202011 in words is "thirteen billion, two hundred thirty million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •