Base | Representation |
---|---|
bin | 111110111000010000011… |
… | …101010110101000111011 |
3 | 120022002021211201102101012 |
4 | 332320100131112220323 |
5 | 1031243413341331024 |
6 | 13105013541344135 |
7 | 624116510305214 |
oct | 76702035265073 |
9 | 16262254642335 |
10 | 4321013230139 |
11 | 1416593357771 |
12 | 59953670804b |
13 | 2546151c2018 |
14 | 10d1d115a40b |
15 | 775ed32b50e |
hex | 3ee10756a3b |
4321013230139 has 8 divisors (see below), whose sum is σ = 4374951885360. Its totient is φ = 4267194307200.
The previous prime is 4321013230133. The next prime is 4321013230141. The reversal of 4321013230139 is 9310323101234.
4321013230139 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4321013230139 - 24 = 4321013230123 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4321013230133) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 29860442 + ... + 30004799.
It is an arithmetic number, because the mean of its divisors is an integer number (546868985670).
Almost surely, 24321013230139 is an apocalyptic number.
4321013230139 is a deficient number, since it is larger than the sum of its proper divisors (53938655221).
4321013230139 is an equidigital number, since it uses as much as digits as its factorization.
4321013230139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59866141.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 4321013230139 in words is "four trillion, three hundred twenty-one billion, thirteen million, two hundred thirty thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •