Base | Representation |
---|---|
bin | 11101001000110000001… |
… | …11100111110101100011 |
3 | 10112201002121112120112101 |
4 | 32210120013213311203 |
5 | 112400304300000311 |
6 | 2043525205511231 |
7 | 132220661600635 |
oct | 16443007476543 |
9 | 3481077476471 |
10 | 1001132031331 |
11 | 356639a28883 |
12 | 142039112517 |
13 | 73538982c73 |
14 | 36652922a55 |
15 | 1b095d27ec1 |
hex | e9181e7d63 |
1001132031331 has 8 divisors (see below), whose sum is σ = 1002161586320. Its totient is φ = 1000102992768.
The previous prime is 1001132031311. The next prime is 1001132031337. The reversal of 1001132031331 is 1331302311001.
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 1001132031331 - 211 = 1001132029283 is a prime.
It is a super-2 number, since 2×10011320313312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001132031299 and 1001132031308.
It is not an unprimeable number, because it can be changed into a prime (1001132031337) 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, 3811600 + ... + 4065778.
It is an arithmetic number, because the mean of its divisors is an integer number (125270198290).
Almost surely, 21001132031331 is an apocalyptic number.
1001132031331 is a deficient number, since it is larger than the sum of its proper divisors (1029554989).
1001132031331 is a wasteful number, since it uses less digits than its factorization.
1001132031331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258213.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1001132031331 its reverse (1331302311001), we get a palindrome (2332434342332).
The spelling of 1001132031331 in words is "one trillion, one billion, one hundred thirty-two million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •