Base | Representation |
---|---|
bin | 10011011001011110010… |
… | …000000100010101100101 |
3 | 11201102202112102202202222 |
4 | 103121132100010111211 |
5 | 133320011402212013 |
6 | 2500214221042125 |
7 | 165210335445545 |
oct | 23313620042545 |
9 | 4642675382688 |
10 | 1333021132133 |
11 | 47437074a539 |
12 | 1964220b6345 |
13 | 9891b362592 |
14 | 48738d3b325 |
15 | 24a1cdb9508 |
hex | 1365e404565 |
1333021132133 has 4 divisors (see below), whose sum is σ = 1351796077728. Its totient is φ = 1314246186540.
The previous prime is 1333021132129. The next prime is 1333021132151. The reversal of 1333021132133 is 3312311203331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1333021132133 - 22 = 1333021132129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1333024132133) 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, 9387472691 + ... + 9387472832.
It is an arithmetic number, because the mean of its divisors is an integer number (337949019432).
Almost surely, 21333021132133 is an apocalyptic number.
It is an amenable number.
1333021132133 is a deficient number, since it is larger than the sum of its proper divisors (18774945595).
1333021132133 is an equidigital number, since it uses as much as digits as its factorization.
1333021132133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18774945594.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1333021132133 its reverse (3312311203331), we get a palindrome (4645332335464).
The spelling of 1333021132133 in words is "one trillion, three hundred thirty-three billion, twenty-one million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •