Base | Representation |
---|---|
bin | 1000101001011010… |
… | …1110011001011101 |
3 | 12222202202211122122 |
4 | 2022112232121131 |
5 | 14223212304041 |
6 | 1022155352325 |
7 | 111343661621 |
oct | 21226563135 |
9 | 5882684578 |
10 | 2321213021 |
11 | a9129a776 |
12 | 5494526a5 |
13 | 2acb9173a |
14 | 1803d1181 |
15 | d8bb1c4b |
hex | 8a5ae65d |
2321213021 has 8 divisors (see below), whose sum is σ = 2333071104. Its totient is φ = 2309368320.
The previous prime is 2321212951. The next prime is 2321213023. The reversal of 2321213021 is 1203121232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2321213021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2321213023) 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, 669725 + ... + 673181.
It is an arithmetic number, because the mean of its divisors is an integer number (291633888).
Almost surely, 22321213021 is an apocalyptic number.
It is an amenable number.
2321213021 is a deficient number, since it is larger than the sum of its proper divisors (11858083).
2321213021 is a wasteful number, since it uses less digits than its factorization.
2321213021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6691.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2321213021 is about 48178.9686585340. The cubic root of 2321213021 is about 1324.0518710872.
Adding to 2321213021 its reverse (1203121232), we get a palindrome (3524334253).
The spelling of 2321213021 in words is "two billion, three hundred twenty-one million, two hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •