Base | Representation |
---|---|
bin | 1001011100010010… |
… | …0011011110010101 |
3 | 20112122012122202121 |
4 | 2113010203132111 |
5 | 20142321202433 |
6 | 1055300135541 |
7 | 116544230533 |
oct | 22704433625 |
9 | 6478178677 |
10 | 2534553493 |
11 | 109076460a |
12 | 5a89975b1 |
13 | 315139bc4 |
14 | 1a0887153 |
15 | ec7a3c2d |
hex | 97123795 |
2534553493 has 2 divisors, whose sum is σ = 2534553494. Its totient is φ = 2534553492.
The previous prime is 2534553421. The next prime is 2534553499. The reversal of 2534553493 is 3943554352.
It is a happy number.
2534553493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1723329169 + 811224324 = 41513^2 + 28482^2 .
It is a cyclic number.
It is not a de Polignac number, because 2534553493 - 221 = 2532456341 is a prime.
It is a super-2 number, since 2×25345534932 = 12847922817757002098, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2534553499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1267276746 + 1267276747.
It is an arithmetic number, because the mean of its divisors is an integer number (1267276747).
Almost surely, 22534553493 is an apocalyptic number.
It is an amenable number.
2534553493 is a deficient number, since it is larger than the sum of its proper divisors (1).
2534553493 is an equidigital number, since it uses as much as digits as its factorization.
2534553493 is an evil number, because the sum of its binary digits is even.
The product of its digits is 972000, while the sum is 43.
The square root of 2534553493 is about 50344.3491665152. The cubic root of 2534553493 is about 1363.4330604903.
The spelling of 2534553493 in words is "two billion, five hundred thirty-four million, five hundred fifty-three thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •