Base | Representation |
---|---|
bin | 10011000111000001000… |
… | …000101111011001101011 |
3 | 11122112121101112122000221 |
4 | 103013001000233121223 |
5 | 133003420011101443 |
6 | 2443135514310511 |
7 | 163606254133342 |
oct | 23070100573153 |
9 | 4575541478027 |
10 | 1313203222123 |
11 | 466a20a90411 |
12 | 192611128437 |
13 | 96ab0610c00 |
14 | 477b8cd4b59 |
15 | 2425d11aeed |
hex | 131c102f66b |
1313203222123 has 48 divisors (see below), whose sum is σ = 1446157177920. Its totient is φ = 1191820511232.
The previous prime is 1313203222117. The next prime is 1313203222157. The reversal of 1313203222123 is 3212223023131.
It is not a de Polignac number, because 1313203222123 - 233 = 1304613287531 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1313203222193) 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 47 ways as a sum of consecutive naturals, for example, 1235374090 + ... + 1235375152.
It is an arithmetic number, because the mean of its divisors is an integer number (30128274540).
Almost surely, 21313203222123 is an apocalyptic number.
1313203222123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1313203222123 is a deficient number, since it is larger than the sum of its proper divisors (132953955797).
1313203222123 is a wasteful number, since it uses less digits than its factorization.
1313203222123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1688 (or 1675 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1313203222123 its reverse (3212223023131), we get a palindrome (4525426245254).
The spelling of 1313203222123 in words is "one trillion, three hundred thirteen billion, two hundred three million, two hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •