Base | Representation |
---|---|
bin | 10011011000100001011… |
… | …001101000111001100101 |
3 | 11201100010101102121201101 |
4 | 103120201121220321211 |
5 | 133310414024343023 |
6 | 2455525031400101 |
7 | 165143131103464 |
oct | 23304131507145 |
9 | 4640111377641 |
10 | 1332000231013 |
11 | 473997450401 |
12 | 196198223031 |
13 | 987b79b7a8a |
14 | 4867d50c9db |
15 | 249ad45a1ad |
hex | 13621668e65 |
1332000231013 has 4 divisors (see below), whose sum is σ = 1332031718880. Its totient is φ = 1331968743148.
The previous prime is 1332000230969. The next prime is 1332000231017. The reversal of 1332000231013 is 3101320002331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1332000231013 - 221 = 1331998133861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332000231017) 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 3 ways as a sum of consecutive naturals, for example, 15680395 + ... + 15765112.
It is an arithmetic number, because the mean of its divisors is an integer number (333007929720).
Almost surely, 21332000231013 is an apocalyptic number.
It is an amenable number.
1332000231013 is a deficient number, since it is larger than the sum of its proper divisors (31487867).
1332000231013 is an equidigital number, since it uses as much as digits as its factorization.
1332000231013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31487866.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1332000231013 its reverse (3101320002331), we get a palindrome (4433320233344).
The spelling of 1332000231013 in words is "one trillion, three hundred thirty-two billion, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •