Base | Representation |
---|---|
bin | 11111000010100111011… |
… | …101000110001001000101 |
3 | 21112220221022211002210211 |
4 | 133002213131012021011 |
5 | 234422103434414341 |
6 | 4311534430515421 |
7 | 310053351021562 |
oct | 37024735061105 |
9 | 7486838732724 |
10 | 2133113201221 |
11 | 752714879092 |
12 | 2a54b3365b71 |
13 | 1261c84068b2 |
14 | 753595cb869 |
15 | 3a7492e6181 |
hex | 1f0a7746245 |
2133113201221 has 8 divisors (see below), whose sum is σ = 2237156025984. Its totient is φ = 2030011940880.
The previous prime is 2133113201201. The next prime is 2133113201231. The reversal of 2133113201221 is 1221023113312.
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 2133113201221 - 229 = 2132576330309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2133113201192 and 2133113201201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2133113201201) 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, 235386465 + ... + 235395526.
It is an arithmetic number, because the mean of its divisors is an integer number (279644503248).
Almost surely, 22133113201221 is an apocalyptic number.
It is an amenable number.
2133113201221 is a deficient number, since it is larger than the sum of its proper divisors (104042824763).
2133113201221 is a wasteful number, since it uses less digits than its factorization.
2133113201221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 470782211.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2133113201221 its reverse (1221023113312), we get a palindrome (3354136314533).
The spelling of 2133113201221 in words is "two trillion, one hundred thirty-three billion, one hundred thirteen million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •