Base | Representation |
---|---|
bin | 111111010001101… |
… | …1000001010101011 |
3 | 12110222011220022011 |
4 | 1332203120022223 |
5 | 13322020000433 |
6 | 550403340351 |
7 | 103420633630 |
oct | 17643301253 |
9 | 5428156264 |
10 | 2123203243 |
11 | 99a547027 |
12 | 4b30816b7 |
13 | 27ab532a5 |
14 | 161daa187 |
15 | c65ec3cd |
hex | 7e8d82ab |
2123203243 has 8 divisors (see below), whose sum is σ = 2432633312. Its totient is φ = 1815302016.
The previous prime is 2123203231. The next prime is 2123203249. The reversal of 2123203243 is 3423023212.
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 2123203243 - 25 = 2123203211 is a prime.
It is a super-2 number, since 2×21232032432 = 9015984022171434098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2123203249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 379230 + ... + 384787.
It is an arithmetic number, because the mean of its divisors is an integer number (304079164).
Almost surely, 22123203243 is an apocalyptic number.
2123203243 is a deficient number, since it is larger than the sum of its proper divisors (309430069).
2123203243 is an equidigital number, since it uses as much as digits as its factorization.
2123203243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764421.
The product of its (nonzero) digits is 1728, while the sum is 22.
The square root of 2123203243 is about 46078.2295992370. The cubic root of 2123203243 is about 1285.2783427079.
Adding to 2123203243 its reverse (3423023212), we get a palindrome (5546226455).
The spelling of 2123203243 in words is "two billion, one hundred twenty-three million, two hundred three thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •