Base | Representation |
---|---|
bin | 10011010110101010010… |
… | …011011000001100010011 |
3 | 11201010222010121002122111 |
4 | 103112222103120030103 |
5 | 133242321014213021 |
6 | 2454554452450151 |
7 | 165042456220543 |
oct | 23265223301423 |
9 | 4633863532574 |
10 | 1330002101011 |
11 | 4730615707a1 |
12 | 19591b019957 |
13 | 98559a4692c |
14 | 4852ddbd323 |
15 | 248e2d168e1 |
hex | 135aa4d8313 |
1330002101011 has 4 divisors (see below), whose sum is σ = 1372905394624. Its totient is φ = 1287098807400.
The previous prime is 1330002100943. The next prime is 1330002101041. The reversal of 1330002101011 is 1101012000331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1330002101011 - 219 = 1330001576723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330002100982 and 1330002101000.
It is not an unprimeable number, because it can be changed into a prime (1330002101041) 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 3 ways as a sum of consecutive naturals, for example, 21451646760 + ... + 21451646821.
It is an arithmetic number, because the mean of its divisors is an integer number (343226348656).
Almost surely, 21330002101011 is an apocalyptic number.
1330002101011 is a deficient number, since it is larger than the sum of its proper divisors (42903293613).
1330002101011 is an equidigital number, since it uses as much as digits as its factorization.
1330002101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42903293612.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1330002101011 its reverse (1101012000331), we get a palindrome (2431014101342).
The spelling of 1330002101011 in words is "one trillion, three hundred thirty billion, two million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •