Search a number
-
+
2855832040215 = 33572111959157223
BaseRepresentation
bin101001100011101100110…
…110101011001100010111
3101010000101211211002202000
4221203230312223030113
5333242221000241330
610023541235450343
7413220115550400
oct51435466531427
911100354732660
102855832040215
11a0117380a780
123a15904569b3
131793c45cca1b
149c319d129a7
154e447b71560
hex298ecdab317

2855832040215 has 768 divisors, whose sum is σ = 6971940864000. Its totient is φ = 1093351633920.

The previous prime is 2855832040213. The next prime is 2855832040241. The reversal of 2855832040215 is 5120402385582.

2855832040215 is a `hidden beast` number, since 2 + 8 + 5 + 583 + 2 + 0 + 40 + 21 + 5 = 666.

It is not a de Polignac number, because 2855832040215 - 21 = 2855832040213 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (45).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2855832040213) 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 767 ways as a sum of consecutive naturals, for example, 12806421594 + ... + 12806421816.

It is an arithmetic number, because the mean of its divisors is an integer number (9078048000).

Almost surely, 22855832040215 is an apocalyptic number.

2855832040215 is an abundant number, since it is smaller than the sum of its proper divisors (4116108823785).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

2855832040215 is a wasteful number, since it uses less digits than its factorization.

2855832040215 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 497 (or 484 counting only the distinct ones).

The product of its (nonzero) digits is 768000, while the sum is 45.

The spelling of 2855832040215 in words is "two trillion, eight hundred fifty-five billion, eight hundred thirty-two million, forty thousand, two hundred fifteen".