Base | Representation |
---|---|
bin | 111110111011010000001… |
… | …101001100110101001110 |
3 | 120022101121001001111101211 |
4 | 332323100031030311032 |
5 | 1031322010414034014 |
6 | 13110305100525034 |
7 | 624262312262545 |
oct | 76732015146516 |
9 | 16271531044354 |
10 | 4324230221134 |
11 | 141799425570a |
12 | 59a093b5077a |
13 | 254a0882c4a5 |
14 | 10d4184c915c |
15 | 7773a983cc4 |
hex | 3eed034cd4e |
4324230221134 has 8 divisors (see below), whose sum is σ = 6624352679328. Its totient is φ = 2116112661360.
The previous prime is 4324230221107. The next prime is 4324230221161. The reversal of 4324230221134 is 4311220324234.
It is an interprime number because it is at equal distance from previous prime (4324230221107) and next prime (4324230221161).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 4324230221096 and 4324230221105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23001224487 + ... + 23001224674.
It is an arithmetic number, because the mean of its divisors is an integer number (828044084916).
Almost surely, 24324230221134 is an apocalyptic number.
4324230221134 is a deficient number, since it is larger than the sum of its proper divisors (2300122458194).
4324230221134 is a wasteful number, since it uses less digits than its factorization.
4324230221134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46002449210.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 4324230221134 its reverse (4311220324234), we get a palindrome (8635450545368).
The spelling of 4324230221134 in words is "four trillion, three hundred twenty-four billion, two hundred thirty million, two hundred twenty-one thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •