Base | Representation |
---|---|
bin | 10011000100111101110… |
… | …111101011011100100100 |
3 | 11122022221001111100200010 |
4 | 103010331313223130210 |
5 | 132434413234000312 |
6 | 2442133320450220 |
7 | 163500606621051 |
oct | 23047567533444 |
9 | 4568831440603 |
10 | 1311003031332 |
11 | 465aa2040515 |
12 | 1920b8319970 |
13 | 9681c843777 |
14 | 4764aa08028 |
15 | 2417edb293c |
hex | 1313ddeb724 |
1311003031332 has 12 divisors (see below), whose sum is σ = 3059007073136. Its totient is φ = 437001010440.
The previous prime is 1311003031319. The next prime is 1311003031361. The reversal of 1311003031332 is 2331303001131.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1311003031299 and 1311003031308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54625126294 + ... + 54625126317.
Almost surely, 21311003031332 is an apocalyptic number.
1311003031332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1311003031332 is an abundant number, since it is smaller than the sum of its proper divisors (1748004041804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311003031332 is a wasteful number, since it uses less digits than its factorization.
1311003031332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109250252618 (or 109250252616 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1311003031332 its reverse (2331303001131), we get a palindrome (3642306032463).
The spelling of 1311003031332 in words is "one trillion, three hundred eleven billion, three million, thirty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •