Base | Representation |
---|---|
bin | 101001001000011000110… |
… | …101011110100000100111 |
3 | 101000012201000002211220102 |
4 | 221020120311132200213 |
5 | 332302140304340201 |
6 | 10002251210454315 |
7 | 411131301246233 |
oct | 51103065364047 |
9 | 11005630084812 |
10 | 2826505152551 |
11 | 99a794520a33 |
12 | 397966a3439b |
13 | 1766cc821862 |
14 | 9ab370435c3 |
15 | 4d7cd1a826b |
hex | 29218d5e827 |
2826505152551 has 8 divisors (see below), whose sum is σ = 2828116747008. Its totient is φ = 2824893715000.
The previous prime is 2826505152511. The next prime is 2826505152571. The reversal of 2826505152551 is 1552515056282.
It is a happy number.
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 2826505152551 - 222 = 2826500958247 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2826505152496 and 2826505152505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2826505152511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73109576 + ... + 73148226.
It is an arithmetic number, because the mean of its divisors is an integer number (353514593376).
Almost surely, 22826505152551 is an apocalyptic number.
2826505152551 is a deficient number, since it is larger than the sum of its proper divisors (1611594457).
2826505152551 is a wasteful number, since it uses less digits than its factorization.
2826505152551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78453.
The product of its (nonzero) digits is 1200000, while the sum is 47.
The spelling of 2826505152551 in words is "two trillion, eight hundred twenty-six billion, five hundred five million, one hundred fifty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •