Base | Representation |
---|---|
bin | 101010011110101… |
… | …0000101111111011 |
3 | 10200100001001111020 |
4 | 1110331100233323 |
5 | 10404342024111 |
6 | 353234033523 |
7 | 50215144221 |
oct | 12475205773 |
9 | 3610031436 |
10 | 1425345531 |
11 | 671630215 |
12 | 3394188a3 |
13 | 1993b402c |
14 | d742cb11 |
15 | 851ee906 |
hex | 54f50bfb |
1425345531 has 4 divisors (see below), whose sum is σ = 1900460712. Its totient is φ = 950230352.
The previous prime is 1425345517. The next prime is 1425345533. The reversal of 1425345531 is 1355435241.
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 1425345531 - 25 = 1425345499 is a prime.
It is a super-2 number, since 2×14253455312 = 4063219765483343922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1425345492 and 1425345501.
It is not an unprimeable number, because it can be changed into a prime (1425345533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 237557586 + ... + 237557591.
It is an arithmetic number, because the mean of its divisors is an integer number (475115178).
Almost surely, 21425345531 is an apocalyptic number.
1425345531 is a deficient number, since it is larger than the sum of its proper divisors (475115181).
1425345531 is an equidigital number, since it uses as much as digits as its factorization.
1425345531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475115180.
The product of its digits is 36000, while the sum is 33.
The square root of 1425345531 is about 37753.7485688507. The cubic root of 1425345531 is about 1125.3995041381.
The spelling of 1425345531 in words is "one billion, four hundred twenty-five million, three hundred forty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •