Base | Representation |
---|---|
bin | 100101000010011010100… |
… | …111101111000101001011 |
3 | 100000022122101120200201012 |
4 | 211002122213233011023 |
5 | 313200044433400310 |
6 | 5225131105114135 |
7 | 351612536250206 |
oct | 45023247570513 |
9 | 10008571520635 |
10 | 2545214746955 |
11 | 8a1468409951 |
12 | 35134332894b |
13 | 156021c4198a |
14 | 8b290a8293d |
15 | 4631831cc05 |
hex | 2509a9ef14b |
2545214746955 has 8 divisors (see below), whose sum is σ = 3054268289952. Its totient is φ = 2036164735168.
The previous prime is 2545214746927. The next prime is 2545214746973. The reversal of 2545214746955 is 5596474125452.
2545214746955 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 2545214746955 - 212 = 2545214742859 is a prime.
It is a super-3 number, since 3×25452147469553 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2545214746894 and 2545214746903.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1113167 + ... + 2515863.
It is an arithmetic number, because the mean of its divisors is an integer number (381783536244).
Almost surely, 22545214746955 is an apocalyptic number.
2545214746955 is a deficient number, since it is larger than the sum of its proper divisors (509053542997).
2545214746955 is a wasteful number, since it uses less digits than its factorization.
2545214746955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1765605.
The product of its digits is 60480000, while the sum is 59.
The spelling of 2545214746955 in words is "two trillion, five hundred forty-five billion, two hundred fourteen million, seven hundred forty-six thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •