Base | Representation |
---|---|
bin | 100100010011110111111… |
… | …100100011000011001001 |
3 | 22211112122121221000201101 |
4 | 210103313330203003021 |
5 | 311340223131014413 |
6 | 5150144155421401 |
7 | 345163252332130 |
oct | 44236774430311 |
9 | 8745577830641 |
10 | 2495240876233 |
11 | 882253473146 |
12 | 343717154861 |
13 | 1513b9720181 |
14 | 88aad9d4917 |
15 | 44d90dd9edd |
hex | 244f7f230c9 |
2495240876233 has 4 divisors (see below), whose sum is σ = 2851703858560. Its totient is φ = 2138777893908.
The previous prime is 2495240876197. The next prime is 2495240876251. The reversal of 2495240876233 is 3326780425942.
2495240876233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2495240876233 - 221 = 2495238779081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2495240876033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 178231491153 + ... + 178231491166.
It is an arithmetic number, because the mean of its divisors is an integer number (712925964640).
Almost surely, 22495240876233 is an apocalyptic number.
It is an amenable number.
2495240876233 is a deficient number, since it is larger than the sum of its proper divisors (356462982327).
2495240876233 is an equidigital number, since it uses as much as digits as its factorization.
2495240876233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356462982326.
The product of its (nonzero) digits is 17418240, while the sum is 55.
The spelling of 2495240876233 in words is "two trillion, four hundred ninety-five billion, two hundred forty million, eight hundred seventy-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •