Base | Representation |
---|---|
bin | 10100101111011000011… |
… | …111010001001110011101 |
3 | 12001020212020220022112002 |
4 | 110233120133101032131 |
5 | 141322421130010103 |
6 | 3010431442052045 |
7 | 204654266145260 |
oct | 24573037211635 |
9 | 5036766808462 |
10 | 1425266250653 |
11 | 4aa4a7707383 |
12 | 1b028694a025 |
13 | a452c35274b |
14 | 4cdaa09ccd7 |
15 | 2711b3c6488 |
hex | 14bd87d139d |
1425266250653 has 8 divisors (see below), whose sum is σ = 1630017195072. Its totient is φ = 1220800676256.
The previous prime is 1425266250623. The next prime is 1425266250671. The reversal of 1425266250653 is 3560526625241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1425266250653 - 226 = 1425199141789 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1425266250598 and 1425266250607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425266250623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71331800 + ... + 71351777.
It is an arithmetic number, because the mean of its divisors is an integer number (203752149384).
Almost surely, 21425266250653 is an apocalyptic number.
It is an amenable number.
1425266250653 is a deficient number, since it is larger than the sum of its proper divisors (204750944419).
1425266250653 is a wasteful number, since it uses less digits than its factorization.
1425266250653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142685011.
The product of its (nonzero) digits is 2592000, while the sum is 47.
The spelling of 1425266250653 in words is "one trillion, four hundred twenty-five billion, two hundred sixty-six million, two hundred fifty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •