Base | Representation |
---|---|
bin | 1001000001001110… |
… | …0010011101111111 |
3 | 20020201121121221001 |
4 | 2100103202131333 |
5 | 14424241303043 |
6 | 1040123151131 |
7 | 113665336432 |
oct | 22023423577 |
9 | 6221547831 |
10 | 2421041023 |
11 | 1032683a55 |
12 | 5769754a7 |
13 | 2c7774b6b |
14 | 18d779819 |
15 | e283074d |
hex | 904e277f |
2421041023 has 4 divisors (see below), whose sum is σ = 2421326128. Its totient is φ = 2420755920.
The previous prime is 2421041011. The next prime is 2421041041. The reversal of 2421041023 is 3201401242.
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 2421041023 - 25 = 2421040991 is a prime.
It is a super-2 number, since 2×24210410232 = 11722879270097773058, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2421041323) 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 3 ways as a sum of consecutive naturals, for example, 129411 + ... + 146932.
It is an arithmetic number, because the mean of its divisors is an integer number (605331532).
Almost surely, 22421041023 is an apocalyptic number.
2421041023 is a deficient number, since it is larger than the sum of its proper divisors (285105).
2421041023 is an equidigital number, since it uses as much as digits as its factorization.
2421041023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285104.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 2421041023 is about 49204.0752682133. The cubic root of 2421041023 is about 1342.7671752488.
Adding to 2421041023 its reverse (3201401242), we get a palindrome (5622442265).
The spelling of 2421041023 in words is "two billion, four hundred twenty-one million, forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •