Base | Representation |
---|---|
bin | 10100101111101110001… |
… | …011011110111001101101 |
3 | 12001021210121122221210011 |
4 | 110233232023132321231 |
5 | 141324142310200131 |
6 | 3010531522013221 |
7 | 204666305304004 |
oct | 24575613367155 |
9 | 5037717587704 |
10 | 1425630162541 |
11 | 4aa674073802 |
12 | 1b03687a7211 |
13 | a4589869c20 |
14 | 4d00254bc3b |
15 | 2713d30c0b1 |
hex | 14bee2dee6d |
1425630162541 has 8 divisors (see below), whose sum is σ = 1535340215864. Its totient is φ = 1315926708480.
The previous prime is 1425630162511. The next prime is 1425630162559. The reversal of 1425630162541 is 1452610365241.
It can be written as a sum of positive squares in 4 ways, for example, as 327923441316 + 1097706721225 = 572646^2 + 1047715^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1425630162541 - 29 = 1425630162029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1425630162494 and 1425630162503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425630162511) 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, 1196520 + ... + 2069521.
It is an arithmetic number, because the mean of its divisors is an integer number (191917526983).
Almost surely, 21425630162541 is an apocalyptic number.
It is an amenable number.
1425630162541 is a deficient number, since it is larger than the sum of its proper divisors (109710053323).
1425630162541 is a wasteful number, since it uses less digits than its factorization.
1425630162541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3299631.
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 1425630162541 in words is "one trillion, four hundred twenty-five billion, six hundred thirty million, one hundred sixty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •