Base | Representation |
---|---|
bin | 10111010100001100… |
… | …010110001110101100 |
3 | 2101121201110210111100 |
4 | 113110030112032230 |
5 | 402232404434202 |
6 | 15300103323100 |
7 | 1544246440422 |
oct | 272414261654 |
9 | 71551423440 |
10 | 25034843052 |
11 | a68757513a |
12 | 4a28150490 |
13 | 248c8159cb |
14 | 12d6c57112 |
15 | 9b7ca641c |
hex | 5d43163ac |
25034843052 has 18 divisors (see below), whose sum is σ = 63282520028. Its totient is φ = 8344947672.
The previous prime is 25034843027. The next prime is 25034843081.
25034843052 is a `hidden beast` number, since 2 + 5 + 0 + 348 + 4 + 305 + 2 = 666.
25034843052 is nontrivially palindromic in base 10.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 695412307 = 25034843052 / (2 + 5 + 0 + 3 + 4 + 8 + 4 + 3 + 0 + 5 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 25034842998 and 25034843016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 347706118 + ... + 347706189.
Almost surely, 225034843052 is an apocalyptic number.
It is an amenable number.
25034843052 is an abundant number, since it is smaller than the sum of its proper divisors (38247676976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25034843052 is a wasteful number, since it uses less digits than its factorization.
25034843052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695412317 (or 695412312 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
The spelling of 25034843052 in words is "twenty-five billion, thirty-four million, eight hundred forty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •