Base | Representation |
---|---|
bin | 11101011111011100001… |
… | …10100001010100110011 |
3 | 10120212112110022011022101 |
4 | 32233232012201110303 |
5 | 113100230333020311 |
6 | 2053301544521231 |
7 | 133131546616360 |
oct | 16575606412463 |
9 | 3525473264271 |
10 | 1013312001331 |
11 | 36081a231593 |
12 | 144478180217 |
13 | 7472a1aaac6 |
14 | 3708a3cb467 |
15 | 1b55a297ec1 |
hex | ebee1a1533 |
1013312001331 has 8 divisors (see below), whose sum is σ = 1158506736480. Its totient is φ = 868226235648.
The previous prime is 1013312001319. The next prime is 1013312001337. The reversal of 1013312001331 is 1331002133101.
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 1013312001331 - 211 = 1013311999283 is a prime.
It is a super-2 number, since 2×10133120013312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013312001299 and 1013312001308.
It is not an unprimeable number, because it can be changed into a prime (1013312001337) 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, 27222436 + ... + 27259633.
It is an arithmetic number, because the mean of its divisors is an integer number (144813342060).
Almost surely, 21013312001331 is an apocalyptic number.
1013312001331 is a deficient number, since it is larger than the sum of its proper divisors (145194735149).
1013312001331 is an equidigital number, since it uses as much as digits as its factorization.
1013312001331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54484733.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1013312001331 its reverse (1331002133101), we get a palindrome (2344314134432).
The spelling of 1013312001331 in words is "one trillion, thirteen billion, three hundred twelve million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •