Base | Representation |
---|---|
bin | 110010000011… |
… | …101001010011 |
3 | 220200200011212 |
4 | 302003221103 |
5 | 11324402011 |
6 | 1145130335 |
7 | 216351641 |
oct | 62035123 |
9 | 26620155 |
10 | 13122131 |
11 | 7452940 |
12 | 44899ab |
13 | 2945999 |
14 | 1a58191 |
15 | 124308b |
hex | c83a53 |
13122131 has 8 divisors (see below), whose sum is σ = 14558400. Its totient is φ = 11726440.
The previous prime is 13122127. The next prime is 13122133.
13122131 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13122131 - 22 = 13122127 is a prime.
It is a super-2 number, since 2×131221312 = 344380643962322, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (13122133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9461 + ... + 10758.
It is an arithmetic number, because the mean of its divisors is an integer number (1819800).
Almost surely, 213122131 is an apocalyptic number.
13122131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13122131 is a deficient number, since it is larger than the sum of its proper divisors (1436269).
13122131 is a wasteful number, since it uses less digits than its factorization.
13122131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20289.
The product of its digits is 36, while the sum is 14.
The square root of 13122131 is about 3622.4482052888. The cubic root of 13122131 is about 235.8675103804.
It can be divided in two parts, 1312 and 2131, that added together give a palindrome (3443).
The spelling of 13122131 in words is "thirteen million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •