Base | Representation |
---|---|
bin | 10011001101010110001… |
… | …101000101110110110111 |
3 | 11200012011011012022220001 |
4 | 103031112031011312313 |
5 | 133111330303413221 |
6 | 2450222235252131 |
7 | 164236601230126 |
oct | 23152615056667 |
9 | 4605134168801 |
10 | 1320001232311 |
11 | 46989a313053 |
12 | 1939a98aa047 |
13 | 97624b13c48 |
14 | 47c61ab1abd |
15 | 24509d36391 |
hex | 13356345db7 |
1320001232311 has 8 divisors (see below), whose sum is σ = 1421788353920. Its totient is φ = 1221445447992.
The previous prime is 1320001232261. The next prime is 1320001232327. The reversal of 1320001232311 is 1132321000231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1320001232311 - 211 = 1320001230263 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320001232351) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 807833475 + ... + 807835108.
It is an arithmetic number, because the mean of its divisors is an integer number (177723544240).
Almost surely, 21320001232311 is an apocalyptic number.
1320001232311 is a deficient number, since it is larger than the sum of its proper divisors (101787121609).
1320001232311 is a wasteful number, since it uses less digits than its factorization.
1320001232311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615668645.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1320001232311 its reverse (1132321000231), we get a palindrome (2452322232542).
The spelling of 1320001232311 in words is "one trillion, three hundred twenty billion, one million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •