Base | Representation |
---|---|
bin | 11101011101100101000… |
… | …11101011000010011011 |
3 | 10120202221211112011021201 |
4 | 32232302203223002123 |
5 | 113041204112312311 |
6 | 2053014501015031 |
7 | 133065026420230 |
oct | 16566243530233 |
9 | 3522854464251 |
10 | 1012313010331 |
11 | 360357337897 |
12 | 1442396b4477 |
13 | 745cb234c7c |
14 | 36dd3863787 |
15 | 1b4ec7159c1 |
hex | ebb28eb09b |
1012313010331 has 8 divisors (see below), whose sum is σ = 1158017525504. Its totient is φ = 866880587880.
The previous prime is 1012313010287. The next prime is 1012313010341. The reversal of 1012313010331 is 1330103132101.
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 1012313010331 - 231 = 1010165526683 is a prime.
It is a super-2 number, since 2×10123130103312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012313010299 and 1012313010308.
It is not an unprimeable number, because it can be changed into a prime (1012313010341) 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, 68015205 + ... + 68030086.
It is an arithmetic number, because the mean of its divisors is an integer number (144752190688).
Almost surely, 21012313010331 is an apocalyptic number.
1012313010331 is a deficient number, since it is larger than the sum of its proper divisors (145704515173).
1012313010331 is a wasteful number, since it uses less digits than its factorization.
1012313010331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136046361.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1012313010331 its reverse (1330103132101), we get a palindrome (2342416142432).
The spelling of 1012313010331 in words is "one trillion, twelve billion, three hundred thirteen million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •