Base | Representation |
---|---|
bin | 10011010111100111000… |
… | …011101111001011000101 |
3 | 11201020121011121102002210 |
4 | 103113213003233023011 |
5 | 133301412440123023 |
6 | 2455243544054033 |
7 | 165106644215040 |
oct | 23274703571305 |
9 | 4636534542083 |
10 | 1331021411013 |
11 | 473534983458 |
12 | 195b64464319 |
13 | 9868cc85148 |
14 | 485c9515c57 |
15 | 2495255e593 |
hex | 135e70ef2c5 |
1331021411013 has 64 divisors (see below), whose sum is σ = 2194712911872. Its totient is φ = 700978924800.
The previous prime is 1331021410997. The next prime is 1331021411039. The reversal of 1331021411013 is 3101141201331.
It is not a de Polignac number, because 1331021411013 - 24 = 1331021410997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331021415013) 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 63 ways as a sum of consecutive naturals, for example, 1479163 + ... + 2202263.
It is an arithmetic number, because the mean of its divisors is an integer number (34292389248).
Almost surely, 21331021411013 is an apocalyptic number.
It is an amenable number.
1331021411013 is a deficient number, since it is larger than the sum of its proper divisors (863691500859).
1331021411013 is a wasteful number, since it uses less digits than its factorization.
1331021411013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723274.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1331021411013 its reverse (3101141201331), we get a palindrome (4432162612344).
The spelling of 1331021411013 in words is "one trillion, three hundred thirty-one billion, twenty-one million, four hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •