Base | Representation |
---|---|
bin | 100101000010011010111… |
… | …111101001010000010111 |
3 | 100000022122211101010020101 |
4 | 211002122333221100113 |
5 | 313200103034431201 |
6 | 5225131451314531 |
7 | 351612643443115 |
oct | 45023277512027 |
9 | 10008584333211 |
10 | 2545221014551 |
11 | 8a14709aa886 |
12 | 35134544ba47 |
13 | 156023327707 |
14 | 8b291834ab5 |
15 | 46318b59d01 |
hex | 2509afe9417 |
2545221014551 has 8 divisors (see below), whose sum is σ = 2548091896064. Its totient is φ = 2542351108320.
The previous prime is 2545221014533. The next prime is 2545221014599. The reversal of 2545221014551 is 1554101225452.
2545221014551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2545221014551 - 215 = 2545220981783 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2545221014551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2545221014051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5043061 + ... + 5524753.
It is an arithmetic number, because the mean of its divisors is an integer number (318511487008).
Almost surely, 22545221014551 is an apocalyptic number.
2545221014551 is a deficient number, since it is larger than the sum of its proper divisors (2870881513).
2545221014551 is a wasteful number, since it uses less digits than its factorization.
2545221014551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487641.
The product of its (nonzero) digits is 80000, while the sum is 37.
The spelling of 2545221014551 in words is "two trillion, five hundred forty-five billion, two hundred twenty-one million, fourteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •