Base | Representation |
---|---|
bin | 111111010001101… |
… | …0111101001100011 |
3 | 12110222011210101122 |
4 | 1332203113221203 |
5 | 13322014413443 |
6 | 550403322455 |
7 | 103420624511 |
oct | 17643275143 |
9 | 5428153348 |
10 | 2123201123 |
11 | 99a54547a |
12 | 4b308042b |
13 | 27ab52334 |
14 | 161da94b1 |
15 | c65eb968 |
hex | 7e8d7a63 |
2123201123 has 4 divisors (see below), whose sum is σ = 2154890760. Its totient is φ = 2091511488.
The previous prime is 2123201071. The next prime is 2123201137. The reversal of 2123201123 is 3211023212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2123201123 - 216 = 2123135587 is a prime.
It is a super-2 number, since 2×21232011232 = 9015966017416922258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2123206123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15844718 + ... + 15844851.
It is an arithmetic number, because the mean of its divisors is an integer number (538722690).
Almost surely, 22123201123 is an apocalyptic number.
2123201123 is a deficient number, since it is larger than the sum of its proper divisors (31689637).
2123201123 is an equidigital number, since it uses as much as digits as its factorization.
2123201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31689636.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2123201123 is about 46078.2065948752. The cubic root of 2123201123 is about 1285.2779149280.
Adding to 2123201123 its reverse (3211023212), we get a palindrome (5334224335).
The spelling of 2123201123 in words is "two billion, one hundred twenty-three million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •