Base | Representation |
---|---|
bin | 10011011001100011000… |
… | …100101010110100100001 |
3 | 11201102222011122210221110 |
4 | 103121203010222310201 |
5 | 133320143104430423 |
6 | 2500230231013533 |
7 | 165212340201660 |
oct | 23314304526441 |
9 | 4642864583843 |
10 | 1333102030113 |
11 | 474402384377 |
12 | 19644520a2a9 |
13 | 989320485c9 |
14 | 48745998dd7 |
15 | 24a25049193 |
hex | 1366312ad21 |
1333102030113 has 32 divisors (see below), whose sum is σ = 2120112654336. Its totient is φ = 728515358208.
The previous prime is 1333102030087. The next prime is 1333102030123. The reversal of 1333102030113 is 3110302013331.
It is not a de Polignac number, because 1333102030113 - 26 = 1333102030049 is a prime.
It is a super-2 number, since 2×13331020301132 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1333102030113.
It is not an unprimeable number, because it can be changed into a prime (1333102030123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2345745 + ... + 2858097.
It is an arithmetic number, because the mean of its divisors is an integer number (66253520448).
Almost surely, 21333102030113 is an apocalyptic number.
It is an amenable number.
1333102030113 is a deficient number, since it is larger than the sum of its proper divisors (787010624223).
1333102030113 is a wasteful number, since it uses less digits than its factorization.
1333102030113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 517773.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1333102030113 its reverse (3110302013331), we get a palindrome (4443404043444).
The spelling of 1333102030113 in words is "one trillion, three hundred thirty-three billion, one hundred two million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •