Base | Representation |
---|---|
bin | 1001000010111000… |
… | …10111110001110100 |
3 | 110112102112001012100 |
4 | 10201130113301310 |
5 | 34421122142402 |
6 | 2121510022100 |
7 | 231223524330 |
oct | 44134276164 |
9 | 13472461170 |
10 | 4856052852 |
11 | 207212a422 |
12 | b36347930 |
13 | 5c509ba71 |
14 | 340d107c0 |
15 | 1d64c071c |
hex | 121717c74 |
4856052852 has 36 divisors (see below), whose sum is σ = 14028597856. Its totient is φ = 1387443600.
The previous prime is 4856052841. The next prime is 4856052853. The reversal of 4856052852 is 2582506584.
It is a happy number.
4856052852 is a `hidden beast` number, since 4 + 8 + 560 + 5 + 2 + 85 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 4856052798 and 4856052807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4856052853) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9634774 + ... + 9635277.
Almost surely, 24856052852 is an apocalyptic number.
4856052852 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
4856052852 is an abundant number, since it is smaller than the sum of its proper divisors (9172545004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4856052852 is a wasteful number, since it uses less digits than its factorization.
4856052852 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19270068 (or 19270063 counting only the distinct ones).
The product of its (nonzero) digits is 768000, while the sum is 45.
The square root of 4856052852 is about 69685.3847804545. The cubic root of 4856052852 is about 1693.4061588364.
The spelling of 4856052852 in words is "four billion, eight hundred fifty-six million, fifty-two thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •