Base | Representation |
---|---|
bin | 111111010011100… |
… | …1110111101110101 |
3 | 12111001002020222112 |
4 | 1332213032331311 |
5 | 13322244323013 |
6 | 550441140405 |
7 | 103432344056 |
oct | 17647167565 |
9 | 5431066875 |
10 | 2124214133 |
11 | 9a0077578 |
12 | 4b348a705 |
13 | 27b118452 |
14 | 16219072d |
15 | c674bba8 |
hex | 7e9cef75 |
2124214133 has 4 divisors (see below), whose sum is σ = 2129760768. Its totient is φ = 2118667500.
The previous prime is 2124214121. The next prime is 2124214171. The reversal of 2124214133 is 3314124212.
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 2124214133 - 28 = 2124213877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2124214099 and 2124214108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2124214033) 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, 2772743 + ... + 2773508.
It is an arithmetic number, because the mean of its divisors is an integer number (532440192).
Almost surely, 22124214133 is an apocalyptic number.
It is an amenable number.
2124214133 is a deficient number, since it is larger than the sum of its proper divisors (5546635).
2124214133 is an equidigital number, since it uses as much as digits as its factorization.
2124214133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5546634.
The product of its digits is 1152, while the sum is 23.
The square root of 2124214133 is about 46089.1975738350. The cubic root of 2124214133 is about 1285.4822906627.
Adding to 2124214133 its reverse (3314124212), we get a palindrome (5438338345).
The spelling of 2124214133 in words is "two billion, one hundred twenty-four million, two hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •