Base | Representation |
---|---|
bin | 10011000111000001011… |
… | …011000001100010000101 |
3 | 11122112121212111200100111 |
4 | 103013001123001202011 |
5 | 133003423242042013 |
6 | 2443140322113021 |
7 | 163606366531003 |
oct | 23070133014205 |
9 | 4575555450314 |
10 | 1313210112133 |
11 | 466a24966a37 |
12 | 1926134ab771 |
13 | 96ab1b8403a |
14 | 477b9ba9a73 |
15 | 2425da2c73d |
hex | 131c16c1885 |
1313210112133 has 8 divisors (see below), whose sum is σ = 1314699960728. Its totient is φ = 1311720873984.
The previous prime is 1313210112131. The next prime is 1313210112161. The reversal of 1313210112133 is 3312110123131.
It can be written as a sum of positive squares in 4 ways, for example, as 3700653889 + 1309509458244 = 60833^2 + 1144338^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1313210112133 - 21 = 1313210112131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313210112131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4223191 + ... + 4523467.
It is an arithmetic number, because the mean of its divisors is an integer number (164337495091).
Almost surely, 21313210112133 is an apocalyptic number.
It is an amenable number.
1313210112133 is a deficient number, since it is larger than the sum of its proper divisors (1489848595).
1313210112133 is a wasteful number, since it uses less digits than its factorization.
1313210112133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305223.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1313210112133 its reverse (3312110123131), we get a palindrome (4625320235264).
The spelling of 1313210112133 in words is "one trillion, three hundred thirteen billion, two hundred ten million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •