Base | Representation |
---|---|
bin | 10011011001101001100… |
… | …001011000011001000101 |
3 | 11201110020201020102201001 |
4 | 103121221201120121011 |
5 | 133320403304020401 |
6 | 2500245053533301 |
7 | 165215122614454 |
oct | 23315141303105 |
9 | 4643221212631 |
10 | 1333210220101 |
11 | 47445845a091 |
12 | 1964754a4231 |
13 | 9894b598b56 |
14 | 487560bcb9b |
15 | 24a2e7ba601 |
hex | 13669858645 |
1333210220101 has 8 divisors (see below), whose sum is σ = 1340850001400. Its totient is φ = 1325573449920.
The previous prime is 1333210220063. The next prime is 1333210220131. The reversal of 1333210220101 is 1010220123331.
It can be written as a sum of positive squares in 4 ways, for example, as 65336472100 + 1267873748001 = 255610^2 + 1125999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1333210220101 - 27 = 1333210219973 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 (1333210220131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138295 + ... + 1638763.
It is an arithmetic number, because the mean of its divisors is an integer number (167606250175).
Almost surely, 21333210220101 is an apocalyptic number.
It is an amenable number.
1333210220101 is a deficient number, since it is larger than the sum of its proper divisors (7639781299).
1333210220101 is a wasteful number, since it uses less digits than its factorization.
1333210220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1505559.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1333210220101 its reverse (1010220123331), we get a palindrome (2343430343432).
The spelling of 1333210220101 in words is "one trillion, three hundred thirty-three billion, two hundred ten million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •