Base | Representation |
---|---|
bin | 100101001001001111011… |
… | …101000110101110111001 |
3 | 100001000120011010012001201 |
4 | 211021033131012232321 |
5 | 313310102130304031 |
6 | 5232342232014201 |
7 | 352262260433263 |
oct | 45111735065671 |
9 | 10030504105051 |
10 | 2552543603641 |
11 | 8a45893573a9 |
12 | 352849831361 |
13 | 15691c40a175 |
14 | 8b788164b33 |
15 | 465e6945d61 |
hex | 2524f746bb9 |
2552543603641 has 8 divisors (see below), whose sum is σ = 2554104731904. Its totient is φ = 2550982891200.
The previous prime is 2552543603627. The next prime is 2552543603671. The reversal of 2552543603641 is 1463063452552.
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 2552543603641 - 213 = 2552543595449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2552543603591 and 2552543603600.
It is not an unprimeable number, because it can be changed into a prime (2552543603611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12651345 + ... + 12851521.
It is an arithmetic number, because the mean of its divisors is an integer number (319263091488).
Almost surely, 22552543603641 is an apocalyptic number.
It is an amenable number.
2552543603641 is a deficient number, since it is larger than the sum of its proper divisors (1561128263).
2552543603641 is a wasteful number, since it uses less digits than its factorization.
2552543603641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207911.
The product of its (nonzero) digits is 2592000, while the sum is 46.
The spelling of 2552543603641 in words is "two trillion, five hundred fifty-two billion, five hundred forty-three million, six hundred three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •