Base | Representation |
---|---|
bin | 11101011111010100000… |
… | …11001001111010010011 |
3 | 10120212100201100211220210 |
4 | 32233222003021322103 |
5 | 113100110431311011 |
6 | 2053251115335203 |
7 | 133130062660323 |
oct | 16575203117223 |
9 | 3525321324823 |
10 | 1013244010131 |
11 | 360794912811 |
12 | 144459451503 |
13 | 74719093722 |
14 | 3708136d283 |
15 | 1b5543176a6 |
hex | ebea0c9e93 |
1013244010131 has 8 divisors (see below), whose sum is σ = 1409730796800. Its totient is φ = 646126615112.
The previous prime is 1013244010061. The next prime is 1013244010217. The reversal of 1013244010131 is 1310104423101.
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 1013244010131 - 214 = 1013243993747 is a prime.
It is a super-2 number, since 2×10132440101312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1013244010098 and 1013244010107.
It is not an unprimeable number, because it can be changed into a prime (1013244050131) 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, 7342347831 + ... + 7342347968.
It is an arithmetic number, because the mean of its divisors is an integer number (176216349600).
Almost surely, 21013244010131 is an apocalyptic number.
1013244010131 is a deficient number, since it is larger than the sum of its proper divisors (396486786669).
1013244010131 is a wasteful number, since it uses less digits than its factorization.
1013244010131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14684695825.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1013244010131 its reverse (1310104423101), we get a palindrome (2323348433232).
The spelling of 1013244010131 in words is "one trillion, thirteen billion, two hundred forty-four million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •