Base | Representation |
---|---|
bin | 11101001001000100011… |
… | …00100100101100010011 |
3 | 10112201112101200012222020 |
4 | 32210202030210230103 |
5 | 112401131040220311 |
6 | 2043554045342523 |
7 | 132225113634246 |
oct | 16444214445423 |
9 | 3481471605866 |
10 | 1001301101331 |
11 | 356716405653 |
12 | 142085867a43 |
13 | 735649cab9b |
14 | 3666b17325d |
15 | 1b0a5ac2c06 |
hex | e922324b13 |
1001301101331 has 16 divisors (see below), whose sum is σ = 1345245773088. Its totient is φ = 662448384000.
The previous prime is 1001301101263. The next prime is 1001301101389. The reversal of 1001301101331 is 1331011031001.
It is not a de Polignac number, because 1001301101331 - 210 = 1001301100307 is a prime.
It is a super-2 number, since 2×10013011013312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1001301101331.
It is not an unprimeable number, because it can be changed into a prime (1001301101831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 892431 + ... + 1673031.
It is an arithmetic number, because the mean of its divisors is an integer number (84077860818).
Almost surely, 21001301101331 is an apocalyptic number.
1001301101331 is a deficient number, since it is larger than the sum of its proper divisors (343944671757).
1001301101331 is a wasteful number, since it uses less digits than its factorization.
1001301101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783862.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1001301101331 its reverse (1331011031001), we get a palindrome (2332312132332).
The spelling of 1001301101331 in words is "one trillion, one billion, three hundred one million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •