Base | Representation |
---|---|
bin | 10100101111011001000… |
… | …010100000111011111111 |
3 | 12001020212220021201120212 |
4 | 110233121002200323333 |
5 | 141322431011140142 |
6 | 3010432412103035 |
7 | 204654440526263 |
oct | 24573102407377 |
9 | 5036786251525 |
10 | 1425275490047 |
11 | 4aa501948042 |
12 | 1b0289a64a7b |
13 | a4531239046 |
14 | 4cdab3c60a3 |
15 | 2711c0edd82 |
hex | 14bd90a0eff |
1425275490047 has 4 divisors (see below), whose sum is σ = 1458421431720. Its totient is φ = 1392129548376.
The previous prime is 1425275490031. The next prime is 1425275490077. The reversal of 1425275490047 is 7400945725241.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1425275490047 - 24 = 1425275490031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1425275489977 and 1425275490004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425275490007) 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 3 ways as a sum of consecutive naturals, for example, 16572970772 + ... + 16572970857.
It is an arithmetic number, because the mean of its divisors is an integer number (364605357930).
Almost surely, 21425275490047 is an apocalyptic number.
1425275490047 is a deficient number, since it is larger than the sum of its proper divisors (33145941673).
1425275490047 is an equidigital number, since it uses as much as digits as its factorization.
1425275490047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33145941672.
The product of its (nonzero) digits is 2822400, while the sum is 50.
The spelling of 1425275490047 in words is "one trillion, four hundred twenty-five billion, two hundred seventy-five million, four hundred ninety thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •