Base | Representation |
---|---|
bin | 11000110010101100… |
… | …01010001100101111 |
3 | 1021100121101020020202 |
4 | 30121112022030233 |
5 | 204224344004411 |
6 | 10040430304115 |
7 | 650560222322 |
oct | 143126121457 |
9 | 37317336222 |
10 | 13310141231 |
11 | 5710256122 |
12 | 26b565803b |
13 | 134171071a |
14 | 903a1c7b9 |
15 | 52d7b583b |
hex | 31958a32f |
13310141231 has 16 divisors (see below), whose sum is σ = 14374668000. Its totient is φ = 12282969600.
The previous prime is 13310141227. The next prime is 13310141237. The reversal of 13310141231 is 13214101331.
13310141231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13310141231 - 22 = 13310141227 is a prime.
It is a super-2 number, since 2×133101412312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310141237) 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 15 ways as a sum of consecutive naturals, for example, 501995 + ... + 527843.
It is an arithmetic number, because the mean of its divisors is an integer number (898416750).
Almost surely, 213310141231 is an apocalyptic number.
13310141231 is a deficient number, since it is larger than the sum of its proper divisors (1064526769).
13310141231 is a wasteful number, since it uses less digits than its factorization.
13310141231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26570.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13310141231 its reverse (13214101331), we get a palindrome (26524242562).
The spelling of 13310141231 in words is "thirteen billion, three hundred ten million, one hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •