Base | Representation |
---|---|
bin | 10011000110000101010… |
… | …001111100111110101111 |
3 | 11122110000112212121121100 |
4 | 103012011101330332233 |
5 | 132444341440214411 |
6 | 2442452235334143 |
7 | 163542365220156 |
oct | 23060521747657 |
9 | 4573015777540 |
10 | 1312201101231 |
11 | 466557349129 |
12 | 1923915b1353 |
13 | 96980b10577 |
14 | 47721b9459d |
15 | 2420016b456 |
hex | 1318547cfaf |
1312201101231 has 6 divisors (see below), whose sum is σ = 1895401590680. Its totient is φ = 874800734148.
The previous prime is 1312201101227. The next prime is 1312201101247. The reversal of 1312201101231 is 1321011022131.
1312201101231 is a `hidden beast` number, since 1 + 312 + 20 + 1 + 101 + 231 = 666.
It is not a de Polignac number, because 1312201101231 - 22 = 1312201101227 is a prime.
It is a super-2 number, since 2×13122011012312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312201105231) 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 5 ways as a sum of consecutive naturals, for example, 72900061171 + ... + 72900061188.
Almost surely, 21312201101231 is an apocalyptic number.
1312201101231 is a deficient number, since it is larger than the sum of its proper divisors (583200489449).
1312201101231 is a wasteful number, since it uses less digits than its factorization.
1312201101231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145800122365 (or 145800122362 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1312201101231 its reverse (1321011022131), we get a palindrome (2633212123362).
The spelling of 1312201101231 in words is "one trillion, three hundred twelve billion, two hundred one million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •