Base | Representation |
---|---|
bin | 101010000110100… |
… | …1110010000101001 |
3 | 10122110100020222220 |
4 | 1110031032100221 |
5 | 10343131034200 |
6 | 352104104253 |
7 | 50003124510 |
oct | 12415162051 |
9 | 3573306886 |
10 | 1412752425 |
11 | 665509897 |
12 | 335165089 |
13 | 1968c50a6 |
14 | d58b1677 |
15 | 840634a0 |
hex | 5434e429 |
1412752425 has 24 divisors (see below), whose sum is σ = 2669430336. Its totient is φ = 645829440.
The previous prime is 1412752421. The next prime is 1412752507. The reversal of 1412752425 is 5242572141.
1412752425 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1412752425 - 22 = 1412752421 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1412752421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1344954 + ... + 1346003.
It is an arithmetic number, because the mean of its divisors is an integer number (111226264).
Almost surely, 21412752425 is an apocalyptic number.
1412752425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1412752425 is a deficient number, since it is larger than the sum of its proper divisors (1256677911).
1412752425 is a wasteful number, since it uses less digits than its factorization.
1412752425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2690977 (or 2690972 counting only the distinct ones).
The product of its digits is 22400, while the sum is 33.
The square root of 1412752425 is about 37586.5990081571. The cubic root of 1412752425 is about 1122.0753466008.
The spelling of 1412752425 in words is "one billion, four hundred twelve million, seven hundred fifty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •