Base | Representation |
---|---|
bin | 10011010110110010000… |
… | …111001011100001000101 |
3 | 11201011022021010121102010 |
4 | 103112302013023201011 |
5 | 133243103034333333 |
6 | 2455015453004433 |
7 | 165045636660360 |
oct | 23266207134105 |
9 | 4634267117363 |
10 | 1330133121093 |
11 | 47311951a057 |
12 | 195956a83719 |
13 | 9857ac2b7ca |
14 | 485435670d7 |
15 | 248ee597563 |
hex | 135b21cb845 |
1330133121093 has 32 divisors (see below), whose sum is σ = 2033738481664. Its totient is φ = 757504576512.
The previous prime is 1330133120993. The next prime is 1330133121101. The reversal of 1330133121093 is 3901213310331.
It is not a de Polignac number, because 1330133121093 - 212 = 1330133116997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1330133121093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330133121193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7264596 + ... + 7445442.
It is an arithmetic number, because the mean of its divisors is an integer number (63554327552).
Almost surely, 21330133121093 is an apocalyptic number.
It is an amenable number.
1330133121093 is a deficient number, since it is larger than the sum of its proper divisors (703605360571).
1330133121093 is a wasteful number, since it uses less digits than its factorization.
1330133121093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182041.
The product of its (nonzero) digits is 4374, while the sum is 30.
The spelling of 1330133121093 in words is "one trillion, three hundred thirty billion, one hundred thirty-three million, one hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •