Base | Representation |
---|---|
bin | 1001011011110001… |
… | …0110111100000001 |
3 | 20112111011111120112 |
4 | 2112330112330001 |
5 | 20141243424433 |
6 | 1055142121105 |
7 | 116520041636 |
oct | 22674267401 |
9 | 6474144515 |
10 | 2532404993 |
11 | 108a527398 |
12 | 5a8120195 |
13 | 314866cc1 |
14 | 1a048818d |
15 | ec4cc348 |
hex | 96f16f01 |
2532404993 has 2 divisors, whose sum is σ = 2532404994. Its totient is φ = 2532404992.
The previous prime is 2532404981. The next prime is 2532405037. The reversal of 2532404993 is 3994042352.
2532404993 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2508707569 + 23697424 = 50087^2 + 4868^2 .
It is a cyclic number.
It is not a de Polignac number, because 2532404993 - 228 = 2263969537 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2532404993.
It is not a weakly prime, because it can be changed into another prime (2532404923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1266202496 + 1266202497.
It is an arithmetic number, because the mean of its divisors is an integer number (1266202497).
Almost surely, 22532404993 is an apocalyptic number.
It is an amenable number.
2532404993 is a deficient number, since it is larger than the sum of its proper divisors (1).
2532404993 is an equidigital number, since it uses as much as digits as its factorization.
2532404993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 233280, while the sum is 41.
The square root of 2532404993 is about 50323.0065973805. The cubic root of 2532404993 is about 1363.0476981973.
The spelling of 2532404993 in words is "two billion, five hundred thirty-two million, four hundred four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •