Base | Representation |
---|---|
bin | 10011011000100011001… |
… | …111000101111111010101 |
3 | 11201100012112100220122202 |
4 | 103120203033011333111 |
5 | 133310444420133023 |
6 | 2455532051334245 |
7 | 165143653602320 |
oct | 23304317057725 |
9 | 4640175326582 |
10 | 1332031021013 |
11 | 473a02870390 |
12 | 1961a65b1385 |
13 | 987c11a8504 |
14 | 486836457b7 |
15 | 249b0edd128 |
hex | 136233c5fd5 |
1332031021013 has 8 divisors (see below), whose sum is σ = 1660714000320. Its totient is φ = 1037946250080.
The previous prime is 1332031021001. The next prime is 1332031021021. The reversal of 1332031021013 is 3101201302331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332031021013 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332031021063) 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, 8649552008 + ... + 8649552161.
It is an arithmetic number, because the mean of its divisors is an integer number (207589250040).
Almost surely, 21332031021013 is an apocalyptic number.
It is an amenable number.
1332031021013 is a deficient number, since it is larger than the sum of its proper divisors (328682979307).
1332031021013 is a wasteful number, since it uses less digits than its factorization.
1332031021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17299104187.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1332031021013 its reverse (3101201302331), we get a palindrome (4433232323344).
The spelling of 1332031021013 in words is "one trillion, three hundred thirty-two billion, thirty-one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •