Base | Representation |
---|---|
bin | 1011011111110111010001… |
… | …10010101000111001000111 |
3 | 10022112010122020001000021022 |
4 | 11233323220302220321013 |
5 | 11303223300232434223 |
6 | 125435203013141355 |
7 | 5216500102154054 |
oct | 557735062507107 |
9 | 108463566030238 |
10 | 25284083093063 |
11 | 8068a1282a053 |
12 | 2a0428432a85b |
13 | 11153816c4872 |
14 | 635a82c4402b |
15 | 2dca6c6d5ac8 |
hex | 16fee8ca8e47 |
25284083093063 has 8 divisors (see below), whose sum is σ = 25416889245696. Its totient is φ = 25151281407000.
The previous prime is 25284083093039. The next prime is 25284083093077. The reversal of 25284083093063 is 36039038048252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25284083093063 is a prime.
It is a super-2 number, since 2×252840830930632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 25284083092996 and 25284083093014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25284083093963) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10554038 + ... + 12726188.
It is an arithmetic number, because the mean of its divisors is an integer number (3177111155712).
Almost surely, 225284083093063 is an apocalyptic number.
25284083093063 is a deficient number, since it is larger than the sum of its proper divisors (132806152633).
25284083093063 is a wasteful number, since it uses less digits than its factorization.
25284083093063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2233285.
The product of its (nonzero) digits is 7464960, while the sum is 53.
The spelling of 25284083093063 in words is "twenty-five trillion, two hundred eighty-four billion, eighty-three million, ninety-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •