Base | Representation |
---|---|
bin | 111111001110101… |
… | …1010100011000101 |
3 | 12110212020111010012 |
4 | 1332131122203011 |
5 | 13321114441013 |
6 | 550310040005 |
7 | 103401433514 |
oct | 17635324305 |
9 | 5425214105 |
10 | 2121640133 |
11 | 9996796a8 |
12 | 4b2649005 |
13 | 27a726982 |
14 | 161ac067b |
15 | c63de1a8 |
hex | 7e75a8c5 |
2121640133 has 4 divisors (see below), whose sum is σ = 2122098828. Its totient is φ = 2121181440.
The previous prime is 2121640127. The next prime is 2121640141. The reversal of 2121640133 is 3310461212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1694721889 + 426918244 = 41167^2 + 20662^2 .
It is a cyclic number.
It is not a de Polignac number, because 2121640133 - 228 = 1853204677 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2121640099 and 2121640108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121640153) 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, 222338 + ... + 231683.
It is an arithmetic number, because the mean of its divisors is an integer number (530524707).
Almost surely, 22121640133 is an apocalyptic number.
It is an amenable number.
2121640133 is a deficient number, since it is larger than the sum of its proper divisors (458695).
2121640133 is an equidigital number, since it uses as much as digits as its factorization.
2121640133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458694.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 2121640133 is about 46061.2649956555. The cubic root of 2121640133 is about 1284.9628564009.
The spelling of 2121640133 in words is "two billion, one hundred twenty-one million, six hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •