Base | Representation |
---|---|
bin | 101100100100111001110… |
… | …0001000010110100010001 |
3 | 210200200201121011010122001 |
4 | 1121021303201002310101 |
5 | 1300334144204444400 |
6 | 21010300425114001 |
7 | 1201425621500611 |
oct | 131116341026421 |
9 | 23620647133561 |
10 | 6126561406225 |
11 | 1a52295216147 |
12 | 82b451028901 |
13 | 355969a18050 |
14 | 172754722a41 |
15 | a9574ebda6a |
hex | 59273842d11 |
6126561406225 has 24 divisors (see below), whose sum is σ = 8181967929912. Its totient is φ = 4523869363200.
The previous prime is 6126561406223. The next prime is 6126561406249. The reversal of 6126561406225 is 5226041656216.
It can be written as a sum of positive squares in 12 ways, for example, as 5089251747969 + 1037309658256 = 2255937^2 + 1018484^2 .
It is not a de Polignac number, because 6126561406225 - 21 = 6126561406223 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6126561406223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3367305 + ... + 4857145.
It is an arithmetic number, because the mean of its divisors is an integer number (340915330413).
Almost surely, 26126561406225 is an apocalyptic number.
6126561406225 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
6126561406225 is a deficient number, since it is larger than the sum of its proper divisors (2055406523687).
6126561406225 is a wasteful number, since it uses less digits than its factorization.
6126561406225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1502517 (or 1502512 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 6126561406225 in words is "six trillion, one hundred twenty-six billion, five hundred sixty-one million, four hundred six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •