Base | Representation |
---|---|
bin | 10011010111111000011… |
… | …100001100000001110100 |
3 | 11201021100111100100201102 |
4 | 103113320130030001310 |
5 | 133303012114031312 |
6 | 2455332522345232 |
7 | 165120115032632 |
oct | 23277034140164 |
9 | 4637314310642 |
10 | 1331313033332 |
11 | 473674555637 |
12 | 19602605b218 |
13 | 9870850b929 |
14 | 48616148352 |
15 | 2496ce65ec2 |
hex | 135f870c074 |
1331313033332 has 12 divisors (see below), whose sum is σ = 2330875934436. Its totient is φ = 665348480640.
The previous prime is 1331313033311. The next prime is 1331313033359. The reversal of 1331313033332 is 2333303131331.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1071382325776 + 259930707556 = 1035076^2 + 509834^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1331313033295 and 1331313033304.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 76999283 + ... + 77016570.
It is an arithmetic number, because the mean of its divisors is an integer number (194239661203).
Almost surely, 21331313033332 is an apocalyptic number.
It is an amenable number.
1331313033332 is a deficient number, since it is larger than the sum of its proper divisors (999562901104).
1331313033332 is a wasteful number, since it uses less digits than its factorization.
1331313033332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154018018 (or 154018016 counting only the distinct ones).
The product of its (nonzero) digits is 13122, while the sum is 29.
Adding to 1331313033332 its reverse (2333303131331), we get a palindrome (3664616164663).
The spelling of 1331313033332 in words is "one trillion, three hundred thirty-one billion, three hundred thirteen million, thirty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •