Base | Representation |
---|---|
bin | 11101011111010010100… |
… | …10101101100111100011 |
3 | 10120212022211110200102212 |
4 | 32233221102231213203 |
5 | 113100044203430311 |
6 | 2053245543232335 |
7 | 133126550020511 |
oct | 16575122554743 |
9 | 3525284420385 |
10 | 1013231311331 |
11 | 360788729a38 |
12 | 1444551486ab |
13 | 74716568645 |
14 | 3707d7c54b1 |
15 | 1b553159c8b |
hex | ebe94ad9e3 |
1013231311331 has 8 divisors (see below), whose sum is σ = 1088845589520. Its totient is φ = 939396192768.
The previous prime is 1013231311319. The next prime is 1013231311409. The reversal of 1013231311331 is 1331131323101.
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 1013231311331 - 226 = 1013164202467 is a prime.
It is a super-2 number, since 2×10132313113312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1013231311297 and 1013231311306.
It is not an unprimeable number, because it can be changed into a prime (1013231313331) 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, 444788726 + ... + 444791003.
It is an arithmetic number, because the mean of its divisors is an integer number (136105698690).
Almost surely, 21013231311331 is an apocalyptic number.
1013231311331 is a deficient number, since it is larger than the sum of its proper divisors (75614278189).
1013231311331 is an equidigital number, since it uses as much as digits as its factorization.
1013231311331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 889579813.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1013231311331 its reverse (1331131323101), we get a palindrome (2344362634432).
The spelling of 1013231311331 in words is "one trillion, thirteen billion, two hundred thirty-one million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •