Base | Representation |
---|---|
bin | 1111010001100100… |
… | …1110011010001101 |
3 | 101120202100110011021 |
4 | 3310121032122031 |
5 | 31344131101300 |
6 | 1514510354141 |
7 | 203415402220 |
oct | 36431163215 |
9 | 11522313137 |
10 | 4100253325 |
11 | 1814539013 |
12 | 9651bb951 |
13 | 5046235cc |
14 | 2ac7ad5b7 |
15 | 18ee79d1a |
hex | f464e68d |
4100253325 has 24 divisors (see below), whose sum is σ = 5813467200. Its totient is φ = 2810236800.
The previous prime is 4100253319. The next prime is 4100253343. The reversal of 4100253325 is 5233520014.
It is not a de Polignac number, because 4100253325 - 27 = 4100253197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 4100253325.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 467985 + ... + 476665.
It is an arithmetic number, because the mean of its divisors is an integer number (242227800).
Almost surely, 24100253325 is an apocalyptic number.
It is an amenable number.
4100253325 is a deficient number, since it is larger than the sum of its proper divisors (1713213875).
4100253325 is a wasteful number, since it uses less digits than its factorization.
4100253325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11397 (or 11392 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 4100253325 is about 64033.2204796854. The cubic root of 4100253325 is about 1600.5536267732.
Adding to 4100253325 its reverse (5233520014), we get a palindrome (9333773339).
The spelling of 4100253325 in words is "four billion, one hundred million, two hundred fifty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •