Base | Representation |
---|---|
bin | 1001010100001000… |
… | …0000111001010101 |
3 | 20110020211002021011 |
4 | 2111002000321111 |
5 | 20110041130031 |
6 | 1052034452221 |
7 | 115650323665 |
oct | 22502007125 |
9 | 6406732234 |
10 | 2500333141 |
11 | 1073411329 |
12 | 599434071 |
13 | 30b017c87 |
14 | 19a0da1a5 |
15 | e97946b1 |
hex | 95080e55 |
2500333141 has 8 divisors (see below), whose sum is σ = 2551955544. Its totient is φ = 2448875520.
The previous prime is 2500333133. The next prime is 2500333153. The reversal of 2500333141 is 1413330052.
It can be written as a sum of positive squares in 4 ways, for example, as 1340658225 + 1159674916 = 36615^2 + 34054^2 .
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 2500333141 - 23 = 2500333133 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 (2500333111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10300 + ... + 71461.
It is an arithmetic number, because the mean of its divisors is an integer number (318994443).
Almost surely, 22500333141 is an apocalyptic number.
It is an amenable number.
2500333141 is a deficient number, since it is larger than the sum of its proper divisors (51622403).
2500333141 is an equidigital number, since it uses as much as digits as its factorization.
2500333141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82391.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 2500333141 is about 50003.3312990245. The cubic root of 2500333141 is about 1357.2690912065.
Adding to 2500333141 its reverse (1413330052), we get a palindrome (3913663193).
The spelling of 2500333141 in words is "two billion, five hundred million, three hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •