Base | Representation |
---|---|
bin | 11000101001010001… |
… | …10101101110100011 |
3 | 1021011002202011102222 |
4 | 30110220311232203 |
5 | 204044133331120 |
6 | 10024525301255 |
7 | 645610636163 |
oct | 142450655643 |
9 | 37132664388 |
10 | 13231152035 |
11 | 567a7053a2 |
12 | 269310482b |
13 | 132b24545a |
14 | 8d733a5a3 |
15 | 5268b1525 |
hex | 314a35ba3 |
13231152035 has 4 divisors (see below), whose sum is σ = 15877382448. Its totient is φ = 10584921624.
The previous prime is 13231152019. The next prime is 13231152041. The reversal of 13231152035 is 53025113231.
13231152035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13231152035 - 24 = 13231152019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13231151995 and 13231152013.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1323115199 + ... + 1323115208.
It is an arithmetic number, because the mean of its divisors is an integer number (3969345612).
Almost surely, 213231152035 is an apocalyptic number.
13231152035 is a deficient number, since it is larger than the sum of its proper divisors (2646230413).
13231152035 is an equidigital number, since it uses as much as digits as its factorization.
13231152035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2646230412.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 13231152035 its reverse (53025113231), we get a palindrome (66256265266).
The spelling of 13231152035 in words is "thirteen billion, two hundred thirty-one million, one hundred fifty-two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •