Base | Representation |
---|---|
bin | 10011000111001000000… |
… | …110010011100000010001 |
3 | 11122112220200021022221200 |
4 | 103013020012103200101 |
5 | 133004140430334413 |
6 | 2443155402541413 |
7 | 163612226561103 |
oct | 23071006234021 |
9 | 4575820238850 |
10 | 1313322121233 |
11 | 466a82110041 |
12 | 192644b07869 |
13 | 96acc140a05 |
14 | 477caa05573 |
15 | 242687a5573 |
hex | 131c8193811 |
1313322121233 has 24 divisors (see below), whose sum is σ = 2003368567200. Its totient is φ = 826764724224.
The previous prime is 1313322121231. The next prime is 1313322121247. The reversal of 1313322121233 is 3321212233131.
1313322121233 is a `hidden beast` number, since 1 + 313 + 3 + 221 + 2 + 123 + 3 = 666.
It is not a de Polignac number, because 1313322121233 - 21 = 1313322121231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1313322121197 and 1313322121206.
It is not an unprimeable number, because it can be changed into a prime (1313322121231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12456048 + ... + 12561041.
It is an arithmetic number, because the mean of its divisors is an integer number (83473690300).
Almost surely, 21313322121233 is an apocalyptic number.
It is an amenable number.
1313322121233 is a deficient number, since it is larger than the sum of its proper divisors (690046445967).
1313322121233 is a wasteful number, since it uses less digits than its factorization.
1313322121233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25017421 (or 25017418 counting only the distinct ones).
The product of its digits is 3888, while the sum is 27.
Adding to 1313322121233 its reverse (3321212233131), we get a palindrome (4634534354364).
The spelling of 1313322121233 in words is "one trillion, three hundred thirteen billion, three hundred twenty-two million, one hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •