Base | Representation |
---|---|
bin | 1000100111101101… |
… | …0011010110000001 |
3 | 12222021020121121111 |
4 | 2021323103112001 |
5 | 14214342234241 |
6 | 1021341323321 |
7 | 111225611410 |
oct | 21173232601 |
9 | 5867217544 |
10 | 2314024321 |
11 | a8822a7a4 |
12 | 546b66541 |
13 | 2ab54567b |
14 | 17d47d477 |
15 | d8241c81 |
hex | 89ed3581 |
2314024321 has 8 divisors (see below), whose sum is σ = 2650492800. Its totient is φ = 1979029248.
The previous prime is 2314024303. The next prime is 2314024327. The reversal of 2314024321 is 1234204132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2314024321 - 29 = 2314023809 is a prime.
It is a super-2 number, since 2×23140243212 = 10709417116359022082, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2314024292 and 2314024301.
It is not an unprimeable number, because it can be changed into a prime (2314024327) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 364981 + ... + 371266.
It is an arithmetic number, because the mean of its divisors is an integer number (331311600).
Almost surely, 22314024321 is an apocalyptic number.
It is an amenable number.
2314024321 is a deficient number, since it is larger than the sum of its proper divisors (336468479).
2314024321 is an equidigital number, since it uses as much as digits as its factorization.
2314024321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736703.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2314024321 is about 48104.3066783006. The cubic root of 2314024321 is about 1322.6836131440.
Adding to 2314024321 its reverse (1234204132), we get a palindrome (3548228453).
The spelling of 2314024321 in words is "two billion, three hundred fourteen million, twenty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •