Base | Representation |
---|---|
bin | 1111010111100010… |
… | …0011110001001001 |
3 | 101122111101010120221 |
4 | 3311320203301021 |
5 | 31422030310424 |
6 | 1521202150041 |
7 | 204140666602 |
oct | 36570436111 |
9 | 11574333527 |
10 | 4125244489 |
11 | 1827658273 |
12 | 971652321 |
13 | 509863792 |
14 | 2b1c36da9 |
15 | 1922649e4 |
hex | f5e23c49 |
4125244489 has 4 divisors (see below), whose sum is σ = 4342362640. Its totient is φ = 3908126340.
The previous prime is 4125244481. The next prime is 4125244537. The reversal of 4125244489 is 9844425214.
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 not a de Polignac number, because 4125244489 - 23 = 4125244481 is a prime.
It is a super-2 number, since 2×41252444892 = 34035284188049742242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4125244481) 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, 108559047 + ... + 108559084.
It is an arithmetic number, because the mean of its divisors is an integer number (1085590660).
Almost surely, 24125244489 is an apocalyptic number.
It is an amenable number.
4125244489 is a deficient number, since it is larger than the sum of its proper divisors (217118151).
4125244489 is a wasteful number, since it uses less digits than its factorization.
4125244489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217118150.
The product of its digits is 368640, while the sum is 43.
The square root of 4125244489 is about 64228.0662094072. The cubic root of 4125244489 is about 1603.7988494976.
The spelling of 4125244489 in words is "four billion, one hundred twenty-five million, two hundred forty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •