Base | Representation |
---|---|
bin | 10011000111000111011… |
… | …100101100001011001000 |
3 | 11122112212220202002121121 |
4 | 103013013130230023020 |
5 | 133004130132242412 |
6 | 2443154333045024 |
7 | 163612035054325 |
oct | 23070734541310 |
9 | 4575786662547 |
10 | 1313311212232 |
11 | 466a76a39a38 |
12 | 192641326774 |
13 | 96ac9ac1496 |
14 | 477c93a5b4c |
15 | 2426784d107 |
hex | 131c772c2c8 |
1313311212232 has 8 divisors (see below), whose sum is σ = 2462458522950. Its totient is φ = 656655606112.
The previous prime is 1313311212229. The next prime is 1313311212233. The reversal of 1313311212232 is 2322121133131.
It can be written as a sum of positive squares in only one way, i.e., 1257910292356 + 55400919876 = 1121566^2 + 235374^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 1313311212197 and 1313311212206.
It is not an unprimeable number, because it can be changed into a prime (1313311212233) 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 as a sum of consecutive naturals, namely, 82081950757 + ... + 82081950772.
Almost surely, 21313311212232 is an apocalyptic number.
It is an amenable number.
1313311212232 is a deficient number, since it is larger than the sum of its proper divisors (1149147310718).
1313311212232 is a wasteful number, since it uses less digits than its factorization.
1313311212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164163901535 (or 164163901531 counting only the distinct ones).
The product of its digits is 1296, while the sum is 25.
Adding to 1313311212232 its reverse (2322121133131), we get a palindrome (3635432345363).
The spelling of 1313311212232 in words is "one trillion, three hundred thirteen billion, three hundred eleven million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •