Base | Representation |
---|---|
bin | 10011001101010110001… |
… | …100101000010001100111 |
3 | 11200012011010222011200100 |
4 | 103031112030220101213 |
5 | 133111330241024033 |
6 | 2450222232515143 |
7 | 164236600213641 |
oct | 23152614502147 |
9 | 4605133864610 |
10 | 1320001111143 |
11 | 46989a240010 |
12 | 1939a984bab3 |
13 | 97624aa0a50 |
14 | 47c61a7d891 |
15 | 24509d10513 |
hex | 13356328467 |
1320001111143 has 48 divisors (see below), whose sum is σ = 2242962592416. Its totient is φ = 737486104320.
The previous prime is 1320001111127. The next prime is 1320001111153. The reversal of 1320001111143 is 3411111000231.
It is a happy number.
It is not a de Polignac number, because 1320001111143 - 24 = 1320001111127 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320001111153) 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 in 47 ways as a sum of consecutive naturals, for example, 296821 + ... + 1651697.
It is an arithmetic number, because the mean of its divisors is an integer number (46728387342).
Almost surely, 21320001111143 is an apocalyptic number.
1320001111143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1320001111143 is a deficient number, since it is larger than the sum of its proper divisors (922961481273).
1320001111143 is a wasteful number, since it uses less digits than its factorization.
1320001111143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355664 (or 1355661 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1320001111143 its reverse (3411111000231), we get a palindrome (4731112111374).
The spelling of 1320001111143 in words is "one trillion, three hundred twenty billion, one million, one hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •