Base | Representation |
---|---|
bin | 1111011110000010… |
… | …0111011010100001 |
3 | 101201101200222211222 |
4 | 3313200213122201 |
5 | 32001021204101 |
6 | 1524014544425 |
7 | 204621600206 |
oct | 36740473241 |
9 | 11641628758 |
10 | 4152522401 |
11 | 1840a995a5 |
12 | 97a808115 |
13 | 5123c4761 |
14 | 2b56d7cad |
15 | 19485201b |
hex | f78276a1 |
4152522401 has 4 divisors (see below), whose sum is σ = 4211008704. Its totient is φ = 4094036100.
The previous prime is 4152522397. The next prime is 4152522421. The reversal of 4152522401 is 1042252514.
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 4152522401 - 22 = 4152522397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4152522421) 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, 29243045 + ... + 29243186.
It is an arithmetic number, because the mean of its divisors is an integer number (1052752176).
Almost surely, 24152522401 is an apocalyptic number.
It is an amenable number.
4152522401 is a deficient number, since it is larger than the sum of its proper divisors (58486303).
4152522401 is an equidigital number, since it uses as much as digits as its factorization.
4152522401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58486302.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 4152522401 is about 64440.0682882940. The cubic root of 4152522401 is about 1607.3260916699.
Adding to 4152522401 its reverse (1042252514), we get a palindrome (5194774915).
The spelling of 4152522401 in words is "four billion, one hundred fifty-two million, five hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •