Base | Representation |
---|---|
bin | 11000110010101100… |
… | …11000110100101011 |
3 | 1021100121111021102021 |
4 | 30121112120310223 |
5 | 204224402414011 |
6 | 10040431445311 |
7 | 650560562053 |
oct | 143126306453 |
9 | 37317437367 |
10 | 13310201131 |
11 | 5710297127 |
12 | 26b5686837 |
13 | 1341731a76 |
14 | 903a36563 |
15 | 52d7c8471 |
hex | 319598d2b |
13310201131 has 16 divisors (see below), whose sum is σ = 13942912320. Its totient is φ = 12682109440.
The previous prime is 13310201117. The next prime is 13310201207. The reversal of 13310201131 is 13110201331.
13310201131 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 13310201131 - 213 = 13310192939 is a prime.
It is a super-2 number, since 2×133102011312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13310201231) 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, 9693561 + ... + 9694933.
It is an arithmetic number, because the mean of its divisors is an integer number (871432020).
Almost surely, 213310201131 is an apocalyptic number.
13310201131 is a deficient number, since it is larger than the sum of its proper divisors (632711189).
13310201131 is a wasteful number, since it uses less digits than its factorization.
13310201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2726.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 13310201131 its reverse (13110201331), we get a palindrome (26420402462).
The spelling of 13310201131 in words is "thirteen billion, three hundred ten million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •