Base | Representation |
---|---|
bin | 10100101111100101111… |
… | …000100000100001001101 |
3 | 12001021102220202021110211 |
4 | 110233211320200201031 |
5 | 141323401142030301 |
6 | 3010510030402421 |
7 | 204662665220620 |
oct | 24574570404115 |
9 | 5037386667424 |
10 | 1425490970701 |
11 | 4aa602543926 |
12 | 1b032a060411 |
13 | a4566a836a5 |
14 | 4cdcbc77db7 |
15 | 27130eb5051 |
hex | 14be5e2084d |
1425490970701 has 32 divisors (see below), whose sum is σ = 1672845343488. Its totient is φ = 1189270978560.
The previous prime is 1425490970689. The next prime is 1425490970707. The reversal of 1425490970701 is 1070790945241.
It is a de Polignac number, because none of the positive numbers 2k-1425490970701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425490970707) 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 31 ways as a sum of consecutive naturals, for example, 102983541 + ... + 102997381.
It is an arithmetic number, because the mean of its divisors is an integer number (52276416984).
Almost surely, 21425490970701 is an apocalyptic number.
It is an amenable number.
1425490970701 is a deficient number, since it is larger than the sum of its proper divisors (247354372787).
1425490970701 is a wasteful number, since it uses less digits than its factorization.
1425490970701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15061.
The product of its (nonzero) digits is 635040, while the sum is 49.
The spelling of 1425490970701 in words is "one trillion, four hundred twenty-five billion, four hundred ninety million, nine hundred seventy thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •