Base | Representation |
---|---|
bin | 10100101111101111101… |
… | …011001111111110110101 |
3 | 12001021212100220101222022 |
4 | 110233233223033332311 |
5 | 141324220222023003 |
6 | 3010534220042525 |
7 | 205000031553410 |
oct | 24575753177665 |
9 | 5037770811868 |
10 | 1425655267253 |
11 | 4aa6872602a8 |
12 | 1b0375093445 |
13 | a4591b19999 |
14 | 4d005a04b77 |
15 | 2714061a738 |
hex | 14befacffb5 |
1425655267253 has 8 divisors (see below), whose sum is σ = 1685503764480. Its totient is φ = 1179852634800.
The previous prime is 1425655267171. The next prime is 1425655267291. The reversal of 1425655267253 is 3527625565241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1425655267253 - 218 = 1425655005109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1425655267195 and 1425655267204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425655267453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3511465973 + ... + 3511466378.
It is an arithmetic number, because the mean of its divisors is an integer number (210687970560).
Almost surely, 21425655267253 is an apocalyptic number.
It is an amenable number.
1425655267253 is a deficient number, since it is larger than the sum of its proper divisors (259848497227).
1425655267253 is an equidigital number, since it uses as much as digits as its factorization.
1425655267253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7022932387.
The product of its digits is 15120000, while the sum is 53.
The spelling of 1425655267253 in words is "one trillion, four hundred twenty-five billion, six hundred fifty-five million, two hundred sixty-seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •