Base | Representation |
---|---|
bin | 11101011111011011111… |
… | …11011001001101101110 |
3 | 10120212112022210020120201 |
4 | 32233231333121031232 |
5 | 113100224343224402 |
6 | 2053301440504114 |
7 | 133131525005551 |
oct | 16575577311556 |
9 | 3525468706521 |
10 | 1013310133102 |
11 | 3608191759a3 |
12 | 14447761b03a |
13 | 747299a5647 |
14 | 3708a062698 |
15 | 1b55a029687 |
hex | ebedfd936e |
1013310133102 has 8 divisors (see below), whose sum is σ = 1552304884896. Its totient is φ = 495875171472.
The previous prime is 1013310133063. The next prime is 1013310133103. The reversal of 1013310133102 is 2013310133101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10133101331022 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1013310133102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013310133103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5389947423 + ... + 5389947610.
It is an arithmetic number, because the mean of its divisors is an integer number (194038110612).
Almost surely, 21013310133102 is an apocalyptic number.
1013310133102 is a deficient number, since it is larger than the sum of its proper divisors (538994751794).
1013310133102 is a wasteful number, since it uses less digits than its factorization.
1013310133102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10779895082.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1013310133102 its reverse (2013310133101), we get a palindrome (3026620266203).
Subtracting 1013310133102 from its reverse (2013310133101), we obtain a palindrome (999999999999).
The spelling of 1013310133102 in words is "one trillion, thirteen billion, three hundred ten million, one hundred thirty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •