Base | Representation |
---|---|
bin | 111111010010000… |
… | …1010111100101001 |
3 | 12110222120110121210 |
4 | 1332210022330221 |
5 | 13322043124431 |
6 | 550412023333 |
7 | 103422461220 |
oct | 17644127451 |
9 | 5428513553 |
10 | 2123411241 |
11 | 99a679326 |
12 | 4b3161b49 |
13 | 27abc6b73 |
14 | 162021cb7 |
15 | c663dd46 |
hex | 7e90af29 |
2123411241 has 32 divisors (see below), whose sum is σ = 3336081408. Its totient is φ = 1175981760.
The previous prime is 2123411237. The next prime is 2123411287. The reversal of 2123411241 is 1421143212.
It is not a de Polignac number, because 2123411241 - 22 = 2123411237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (2123411201) 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 31 ways as a sum of consecutive naturals, for example, 199156 + ... + 209546.
It is an arithmetic number, because the mean of its divisors is an integer number (104252544).
Almost surely, 22123411241 is an apocalyptic number.
2123411241 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2123411241 is a deficient number, since it is larger than the sum of its proper divisors (1212670167).
2123411241 is a wasteful number, since it uses less digits than its factorization.
2123411241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10701.
The product of its digits is 384, while the sum is 21.
The square root of 2123411241 is about 46080.4865534209. The cubic root of 2123411241 is about 1285.3203117777.
Adding to 2123411241 its reverse (1421143212), we get a palindrome (3544554453).
The spelling of 2123411241 in words is "two billion, one hundred twenty-three million, four hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •