Base | Representation |
---|---|
bin | 100011001111000010000… |
… | …111100101010110001111 |
3 | 22120110212012001220201121 |
4 | 203033002013211112033 |
5 | 304132332234334120 |
6 | 5052201322421411 |
7 | 336635435636260 |
oct | 43170207452617 |
9 | 8513765056647 |
10 | 2421323355535 |
11 | 853971a01867 |
12 | 331328361867 |
13 | 1474397a1b46 |
14 | 8529a9b8967 |
15 | 42eb68e75aa |
hex | 233c21e558f |
2421323355535 has 32 divisors (see below), whose sum is σ = 3355807150080. Its totient is φ = 1642856971392.
The previous prime is 2421323355533. The next prime is 2421323355613. The reversal of 2421323355535 is 5355533231242.
2421323355535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2421323355535 - 21 = 2421323355533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2421323355491 and 2421323355500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2421323355533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 391462 + ... + 2235148.
It is an arithmetic number, because the mean of its divisors is an integer number (104868973440).
Almost surely, 22421323355535 is an apocalyptic number.
2421323355535 is a deficient number, since it is larger than the sum of its proper divisors (934483794545).
2421323355535 is a wasteful number, since it uses less digits than its factorization.
2421323355535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1844095.
The product of its digits is 1620000, while the sum is 43.
Adding to 2421323355535 its reverse (5355533231242), we get a palindrome (7776856586777).
The spelling of 2421323355535 in words is "two trillion, four hundred twenty-one billion, three hundred twenty-three million, three hundred fifty-five thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •