Base | Representation |
---|---|
bin | 10011010110101011011… |
… | …100010010000010010111 |
3 | 11201011000110120001102102 |
4 | 103112223130102002113 |
5 | 133242340412243221 |
6 | 2455000414232315 |
7 | 165043110525611 |
oct | 23265334220227 |
9 | 4634013501372 |
10 | 1330021212311 |
11 | 473071334360 |
12 | 1959254b569b |
13 | 985609a86ac |
14 | 48532755db1 |
15 | 248e483e30b |
hex | 135ab712097 |
1330021212311 has 4 divisors (see below), whose sum is σ = 1450932231624. Its totient is φ = 1209110193000.
The previous prime is 1330021212293. The next prime is 1330021212323. The reversal of 1330021212311 is 1132121200331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1330021212311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330021218311) 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, 60455509640 + ... + 60455509661.
It is an arithmetic number, because the mean of its divisors is an integer number (362733057906).
Almost surely, 21330021212311 is an apocalyptic number.
1330021212311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1330021212311 is a deficient number, since it is larger than the sum of its proper divisors (120911019313).
1330021212311 is a wasteful number, since it uses less digits than its factorization.
1330021212311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120911019312.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1330021212311 its reverse (1132121200331), we get a palindrome (2462142412642).
The spelling of 1330021212311 in words is "one trillion, three hundred thirty billion, twenty-one million, two hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •