Base | Representation |
---|---|
bin | 10011000101111001101… |
… | …001101101010111010011 |
3 | 11122102111221202112221202 |
4 | 103011321221231113103 |
5 | 132443442014032011 |
6 | 2442421025541415 |
7 | 163534506004136 |
oct | 23057151552723 |
9 | 4572457675852 |
10 | 1312006002131 |
11 | 466467203300 |
12 | 1923381a486b |
13 | 9694c580c06 |
14 | 47703cca21d |
15 | 241dce7e23b |
hex | 13179a6d5d3 |
1312006002131 has 24 divisors (see below), whose sum is σ = 1446829860000. Its totient is φ = 1188842054400.
The previous prime is 1312006002119. The next prime is 1312006002157.
1312006002131 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-1312006002131 is a prime.
It is a super-2 number, since 2×13120060021312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312006002191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 148261595 + ... + 148270443.
It is an arithmetic number, because the mean of its divisors is an integer number (60284577500).
Almost surely, 21312006002131 is an apocalyptic number.
1312006002131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1312006002131 is a deficient number, since it is larger than the sum of its proper divisors (134823857869).
1312006002131 is a wasteful number, since it uses less digits than its factorization.
1312006002131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12731 (or 12720 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
The spelling of 1312006002131 in words is "one trillion, three hundred twelve billion, six million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •