Base | Representation |
---|---|
bin | 11000110101011010… |
… | …10100100010110011 |
3 | 1021102012101002001022 |
4 | 30122231110202303 |
5 | 204301221141011 |
6 | 10043004130055 |
7 | 651255355226 |
oct | 143255244263 |
9 | 37365332038 |
10 | 13332990131 |
11 | 572214190a |
12 | 270123692b |
13 | 1346380796 |
14 | 906a895bd |
15 | 5307ca8db |
hex | 31ab548b3 |
13332990131 has 2 divisors, whose sum is σ = 13332990132. Its totient is φ = 13332990130.
The previous prime is 13332990109. The next prime is 13332990169. The reversal of 13332990131 is 13109923331.
13332990131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (13109923331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13332990131 - 210 = 13332989107 is a prime.
It is a super-2 number, since 2×133329901312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13332990091 and 13332990100.
It is not a weakly prime, because it can be changed into another prime (13332990101) 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 as a sum of consecutive naturals, namely, 6666495065 + 6666495066.
It is an arithmetic number, because the mean of its divisors is an integer number (6666495066).
Almost surely, 213332990131 is an apocalyptic number.
13332990131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13332990131 is an equidigital number, since it uses as much as digits as its factorization.
13332990131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 35.
The spelling of 13332990131 in words is "thirteen billion, three hundred thirty-two million, nine hundred ninety thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •