Base | Representation |
---|---|
bin | 111100000010000110011… |
… | …001100000001011001101 |
3 | 112121101102212000102122212 |
4 | 330002012121200023031 |
5 | 1020042331344431433 |
6 | 12435105433320205 |
7 | 604023560425532 |
oct | 74020631401315 |
9 | 15541385012585 |
10 | 4125423436493 |
11 | 1350644a86907 |
12 | 56764bb66065 |
13 | 23c04479a608 |
14 | 103958a8cd89 |
15 | 724a2159d48 |
hex | 3c0866602cd |
4125423436493 has 4 divisors (see below), whose sum is σ = 4195345867680. Its totient is φ = 4055501005308.
The previous prime is 4125423436489. The next prime is 4125423436507. The reversal of 4125423436493 is 3946343245214.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4125423436493 - 22 = 4125423436489 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4125423436423) 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 3 ways as a sum of consecutive naturals, for example, 34961215505 + ... + 34961215622.
It is an arithmetic number, because the mean of its divisors is an integer number (1048836466920).
Almost surely, 24125423436493 is an apocalyptic number.
It is an amenable number.
4125423436493 is a deficient number, since it is larger than the sum of its proper divisors (69922431187).
4125423436493 is an equidigital number, since it uses as much as digits as its factorization.
4125423436493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69922431186.
The product of its digits is 7464960, while the sum is 50.
The spelling of 4125423436493 in words is "four trillion, one hundred twenty-five billion, four hundred twenty-three million, four hundred thirty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •