Base | Representation |
---|---|
bin | 10011011000100111111… |
… | …100011111110111001011 |
3 | 11201100102001001002210212 |
4 | 103120213330133313023 |
5 | 133311130132013311 |
6 | 2455543553031335 |
7 | 165145633310111 |
oct | 23304774376713 |
9 | 4640361032725 |
10 | 1332110032331 |
11 | 473a434267a1 |
12 | 196208b5554b |
13 | 98804680880 |
14 | 4868dd31ab1 |
15 | 249b7de8c8b |
hex | 13627f1fdcb |
1332110032331 has 8 divisors (see below), whose sum is σ = 1434808886784. Its totient is φ = 1229443871040.
The previous prime is 1332110032307. The next prime is 1332110032361. The reversal of 1332110032331 is 1332300112331.
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 1332110032331 - 222 = 1332105838027 is a prime.
It is a super-2 number, since 2×13321100323312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1332110032297 and 1332110032306.
It is not an unprimeable number, because it can be changed into a prime (1332110032361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8088626 + ... + 8251671.
It is an arithmetic number, because the mean of its divisors is an integer number (179351110848).
Almost surely, 21332110032331 is an apocalyptic number.
1332110032331 is a deficient number, since it is larger than the sum of its proper divisors (102698854453).
1332110032331 is a wasteful number, since it uses less digits than its factorization.
1332110032331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16346581.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1332110032331 its reverse (1332300112331), we get a palindrome (2664410144662).
The spelling of 1332110032331 in words is "one trillion, three hundred thirty-two billion, one hundred ten million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •