Base | Representation |
---|---|
bin | 11000110110100111… |
… | …00001000111111011 |
3 | 1021102220012210022011 |
4 | 30123103201013323 |
5 | 204311302100011 |
6 | 10044002510351 |
7 | 651436440523 |
oct | 143323410773 |
9 | 37386183264 |
10 | 13343003131 |
11 | 5727860817 |
12 | 27046653b7 |
13 | 1348478233 |
14 | 908134683 |
15 | 531607621 |
hex | 31b4e11fb |
13343003131 has 4 divisors (see below), whose sum is σ = 13356577872. Its totient is φ = 13329428392.
The previous prime is 13343003119. The next prime is 13343003147. The reversal of 13343003131 is 13130034331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13130034331 = 71 ⋅184930061.
It is a cyclic number.
It is not a de Polignac number, because 13343003131 - 213 = 13342994939 is a prime.
It is a super-2 number, since 2×133430031312 (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 (13343000131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6785896 + ... + 6787861.
It is an arithmetic number, because the mean of its divisors is an integer number (3339144468).
Almost surely, 213343003131 is an apocalyptic number.
13343003131 is a deficient number, since it is larger than the sum of its proper divisors (13574741).
13343003131 is an equidigital number, since it uses as much as digits as its factorization.
13343003131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13574740.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13343003131 its reverse (13130034331), we get a palindrome (26473037462).
The spelling of 13343003131 in words is "thirteen billion, three hundred forty-three million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •