Base | Representation |
---|---|
bin | 1001011010001000… |
… | …1110010101111011 |
3 | 20112000021102211122 |
4 | 2112202032111323 |
5 | 20133020212133 |
6 | 1054335215455 |
7 | 116404566215 |
oct | 22642162573 |
9 | 6460242748 |
10 | 2525554043 |
11 | 1086678151 |
12 | 5a597758b |
13 | 31330889c |
14 | 19d5c35b5 |
15 | ebac7498 |
hex | 9688e57b |
2525554043 has 4 divisors (see below), whose sum is σ = 2658477960. Its totient is φ = 2392630128.
The previous prime is 2525554033. The next prime is 2525554061. The reversal of 2525554043 is 3404555252.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2525554043 - 216 = 2525488507 is a prime.
It is a super-2 number, since 2×25255540432 = 12756846448227291698, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2525553994 and 2525554012.
It is not an unprimeable number, because it can be changed into a prime (2525554033) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 66461930 + ... + 66461967.
It is an arithmetic number, because the mean of its divisors is an integer number (664619490).
Almost surely, 22525554043 is an apocalyptic number.
2525554043 is a deficient number, since it is larger than the sum of its proper divisors (132923917).
2525554043 is a wasteful number, since it uses less digits than its factorization.
2525554043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132923916.
The product of its (nonzero) digits is 120000, while the sum is 35.
The square root of 2525554043 is about 50254.8907371213. The cubic root of 2525554043 is about 1361.8174308918.
The spelling of 2525554043 in words is "two billion, five hundred twenty-five million, five hundred fifty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •