Base | Representation |
---|---|
bin | 11101011111000101011… |
… | …11100011001001110011 |
3 | 10120212001011201010202210 |
4 | 32233202233203021303 |
5 | 113044333041231011 |
6 | 2053231020143203 |
7 | 133124044032246 |
oct | 16574257431163 |
9 | 3525034633683 |
10 | 1013121430131 |
11 | 3607316a9628 |
12 | 144424397b03 |
13 | 746c9875395 |
14 | 3706cd8125d |
15 | 1b5486a26a6 |
hex | ebe2be3273 |
1013121430131 has 8 divisors (see below), whose sum is σ = 1430289077904. Its totient is φ = 635684034560.
The previous prime is 1013121430049. The next prime is 1013121430163. The reversal of 1013121430131 is 1310341213101.
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 1013121430131 - 215 = 1013121397363 is a prime.
It is a super-2 number, since 2×10131214301312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1013121430098 and 1013121430107.
It is not an unprimeable number, because it can be changed into a prime (1013121430171) 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, 9932562990 + ... + 9932563091.
It is an arithmetic number, because the mean of its divisors is an integer number (178786134738).
Almost surely, 21013121430131 is an apocalyptic number.
1013121430131 is a deficient number, since it is larger than the sum of its proper divisors (417167647773).
1013121430131 is a wasteful number, since it uses less digits than its factorization.
1013121430131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19865126101.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1013121430131 its reverse (1310341213101), we get a palindrome (2323462643232).
The spelling of 1013121430131 in words is "one trillion, thirteen billion, one hundred twenty-one million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •