Base | Representation |
---|---|
bin | 11110000000110000110… |
… | …00000011100001110011 |
3 | 10122120201011211001012120 |
4 | 33000120120003201303 |
5 | 113343344441011011 |
6 | 2105421030325323 |
7 | 134334060545463 |
oct | 17003030034163 |
9 | 3576634731176 |
10 | 1031201110131 |
11 | 36836a163825 |
12 | 147a2b1b9843 |
13 | 7631b45349a |
14 | 37ca61cdba3 |
15 | 1bc55a49a06 |
hex | f018603873 |
1031201110131 has 8 divisors (see below), whose sum is σ = 1374941706240. Its totient is φ = 687463960392.
The previous prime is 1031201110099. The next prime is 1031201110193. The reversal of 1031201110131 is 1310111021301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1031201110131 - 25 = 1031201110099 is a prime.
It is a super-2 number, since 2×10312011101312 (a number of 25 digits) contains 22 as substring.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1031201110131.
It is not an unprimeable number, because it can be changed into a prime (1031201110831) 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, 55755 + ... + 1437188.
It is an arithmetic number, because the mean of its divisors is an integer number (171867713280).
Almost surely, 21031201110131 is an apocalyptic number.
1031201110131 is a deficient number, since it is larger than the sum of its proper divisors (343740596109).
1031201110131 is a wasteful number, since it uses less digits than its factorization.
1031201110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1723185.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 1031201110131 its reverse (1310111021301), we get a palindrome (2341312131432).
The spelling of 1031201110131 in words is "one trillion, thirty-one billion, two hundred one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •