Base | Representation |
---|---|
bin | 10011000110000001001… |
… | …010010111000110101111 |
3 | 11122102211201212000120211 |
4 | 103012001022113012233 |
5 | 132444221243032343 |
6 | 2442441330323251 |
7 | 163540565665300 |
oct | 23060112270657 |
9 | 4572751760524 |
10 | 1312132002223 |
11 | 466521343009 |
12 | 192372429527 |
13 | 9696c6c8b93 |
14 | 477169287a7 |
15 | 241e906c79d |
hex | 131812971af |
1312132002223 has 12 divisors (see below), whose sum is σ = 1538376206592. Its totient is φ = 1115828784000.
The previous prime is 1312132002169. The next prime is 1312132002331. The reversal of 1312132002223 is 3222002312131.
It is not a de Polignac number, because 1312132002223 - 225 = 1312098447791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1312132002194 and 1312132002203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312135002223) 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 11 ways as a sum of consecutive naturals, for example, 105419778 + ... + 105432223.
It is an arithmetic number, because the mean of its divisors is an integer number (128198017216).
Almost surely, 21312132002223 is an apocalyptic number.
1312132002223 is a deficient number, since it is larger than the sum of its proper divisors (226244204369).
1312132002223 is a wasteful number, since it uses less digits than its factorization.
1312132002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210852142 (or 210852135 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1312132002223 its reverse (3222002312131), we get a palindrome (4534134314354).
The spelling of 1312132002223 in words is "one trillion, three hundred twelve billion, one hundred thirty-two million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •