Base | Representation |
---|---|
bin | 11101001000100000110… |
… | …00101111011011001011 |
3 | 10112200202120102121011011 |
4 | 32210100120233123023 |
5 | 112400023042114011 |
6 | 2043504253144351 |
7 | 132214525112530 |
oct | 16442030573313 |
9 | 3480676377134 |
10 | 1001002301131 |
11 | 356582780638 |
12 | 14200178b0b7 |
13 | 73517b30231 |
14 | 3663d5d2d87 |
15 | 1b08974e621 |
hex | e91062f6cb |
1001002301131 has 8 divisors (see below), whose sum is σ = 1144205045984. Its totient is φ = 857850160320.
The previous prime is 1001002301119. The next prime is 1001002301149. The reversal of 1001002301131 is 1311032001001.
1001002301131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1001002301131 - 215 = 1001002268363 is a prime.
It is a super-2 number, since 2×10010023011312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1001002307131) 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, 12608610 + ... + 12687751.
It is an arithmetic number, because the mean of its divisors is an integer number (143025630748).
Almost surely, 21001002301131 is an apocalyptic number.
1001002301131 is a deficient number, since it is larger than the sum of its proper divisors (143202744853).
1001002301131 is an equidigital number, since it uses as much as digits as its factorization.
1001002301131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25302021.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1001002301131 its reverse (1311032001001), we get a palindrome (2312034302132).
The spelling of 1001002301131 in words is "one trillion, one billion, two million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •