Base | Representation |
---|---|
bin | 10011000100111101101… |
… | …111111100000000010000 |
3 | 11122022220220200020221200 |
4 | 103010331233330000100 |
5 | 132434412224031000 |
6 | 2442133205151200 |
7 | 163500553436454 |
oct | 23047557740020 |
9 | 4568826606850 |
10 | 1311001002000 |
11 | 465aa0984888 |
12 | 1920b76bb500 |
13 | 9681c2b2b91 |
14 | 4764a63a664 |
15 | 2417eb11500 |
hex | 1313dbfc010 |
1311001002000 has 240 divisors, whose sum is σ = 4848237072432. Its totient is φ = 329035468800.
The previous prime is 1311001001977. The next prime is 1311001002011. The reversal of 1311001002000 is 2001001131.
It can be written as a sum of positive squares in 8 ways, for example, as 448621323264 + 862379678736 = 669792^2 + 928644^2 .
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (9).
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 47 ways as a sum of consecutive naturals, for example, 1836159 + ... + 2448158.
Almost surely, 21311001002000 is an apocalyptic number.
1311001002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1311001002000 is an abundant number, since it is smaller than the sum of its proper divisors (3537236070432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311001002000 is a wasteful number, since it uses less digits than its factorization.
1311001002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4284363 (or 4284344 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 1311001002000 its reverse (2001001131), we get a palindrome (1313002003131).
The spelling of 1311001002000 in words is "one trillion, three hundred eleven billion, one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •