Base | Representation |
---|---|
bin | 10011011001011110010… |
… | …011011000011111001101 |
3 | 11201102202121001220202222 |
4 | 103121132103120133031 |
5 | 133320012113013401 |
6 | 2500214251425125 |
7 | 165210346025150 |
oct | 23313623303715 |
9 | 4642677056688 |
10 | 1333022001101 |
11 | 47437119339a |
12 | 1964224551a5 |
13 | 9891b5a7c6b |
14 | 487390c5c97 |
15 | 24a1cedbc1b |
hex | 1365e4d87cd |
1333022001101 has 32 divisors (see below), whose sum is σ = 1577598612480. Its totient is φ = 1102875653376.
The previous prime is 1333022001043. The next prime is 1333022001133. The reversal of 1333022001101 is 1011002203331.
It is a de Polignac number, because none of the positive numbers 2k-1333022001101 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 1333022001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1333022004101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4860110 + ... + 5127056.
It is an arithmetic number, because the mean of its divisors is an integer number (49299956640).
Almost surely, 21333022001101 is an apocalyptic number.
It is an amenable number.
1333022001101 is a deficient number, since it is larger than the sum of its proper divisors (244576611379).
1333022001101 is a wasteful number, since it uses less digits than its factorization.
1333022001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267233.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1333022001101 its reverse (1011002203331), we get a palindrome (2344024204432).
The spelling of 1333022001101 in words is "one trillion, three hundred thirty-three billion, twenty-two million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •