Base | Representation |
---|---|
bin | 1011101010110011100001… |
… | …11110011110100001000101 |
3 | 10100212002000121120022111000 |
4 | 11311121300332132201011 |
5 | 11330403220143134141 |
6 | 130324015521203513 |
7 | 5255606315454132 |
oct | 565316076364105 |
9 | 110762017508430 |
10 | 25660030052421 |
11 | 81a33a3010a66 |
12 | 2a65104190599 |
13 | 1141965a5547b |
14 | 649d48721589 |
15 | 2e77226125b6 |
hex | 175670f9e845 |
25660030052421 has 32 divisors (see below), whose sum is σ = 38408955603200. Its totient is φ = 16929363502080.
The previous prime is 25660030052353. The next prime is 25660030052431. The reversal of 25660030052421 is 12425003006652.
25660030052421 is a `hidden beast` number, since 2 + 5 + 6 + 600 + 3 + 0 + 0 + 5 + 2 + 42 + 1 = 666.
It is not a de Polignac number, because 25660030052421 - 215 = 25660030019653 is a prime.
It is a super-2 number, since 2×256600300524212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25660030052431) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47188560 + ... + 47729238.
It is an arithmetic number, because the mean of its divisors is an integer number (1200279862600).
Almost surely, 225660030052421 is an apocalyptic number.
It is an amenable number.
25660030052421 is a deficient number, since it is larger than the sum of its proper divisors (12748925550779).
25660030052421 is a wasteful number, since it uses less digits than its factorization.
25660030052421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 558906 (or 558900 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 25660030052421 in words is "twenty-five trillion, six hundred sixty billion, thirty million, fifty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •