Base | Representation |
---|---|
bin | 10011011000100001011… |
… | …000111000011001001011 |
3 | 11201100010101001112011210 |
4 | 103120201120320121023 |
5 | 133310414002013311 |
6 | 2455525023224203 |
7 | 165143126315313 |
oct | 23304130703113 |
9 | 4640111045153 |
10 | 1332000032331 |
11 | 473997325101 |
12 | 196198148063 |
13 | 987b7948507 |
14 | 4867d49a443 |
15 | 249ad41b3a6 |
hex | 1362163864b |
1332000032331 has 16 divisors (see below), whose sum is σ = 1792705229568. Its totient is φ = 879648420000.
The previous prime is 1332000032329. The next prime is 1332000032333. The reversal of 1332000032331 is 1332300002331.
It is an interprime number because it is at equal distance from previous prime (1332000032329) and next prime (1332000032333).
It is not a de Polignac number, because 1332000032331 - 21 = 1332000032329 is a prime.
It is a super-2 number, since 2×13320000323312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1332000032298 and 1332000032307.
It is not an unprimeable number, because it can be changed into a prime (1332000032333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5682706 + ... + 5912456.
It is an arithmetic number, because the mean of its divisors is an integer number (112044076848).
Almost surely, 21332000032331 is an apocalyptic number.
1332000032331 is a deficient number, since it is larger than the sum of its proper divisors (460705197237).
1332000032331 is a wasteful number, since it uses less digits than its factorization.
1332000032331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247922.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 1332000032331 its reverse (1332300002331), we get a palindrome (2664300034662).
The spelling of 1332000032331 in words is "one trillion, three hundred thirty-two billion, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •