Base | Representation |
---|---|
bin | 1111111011010010… |
… | …0110010110010111 |
3 | 102000221112201211202 |
4 | 3332310212112113 |
5 | 32223422421211 |
6 | 1544120223115 |
7 | 210641420054 |
oct | 37664462627 |
9 | 12027481752 |
10 | 4275201431 |
11 | 18a4270126 |
12 | 9b390aa9b |
13 | 531948bb7 |
14 | 2c7b1002b |
15 | 1a04d653b |
hex | fed26597 |
4275201431 has 8 divisors (see below), whose sum is σ = 4448191680. Its totient is φ = 4103915872.
The previous prime is 4275201397. The next prime is 4275201439. The reversal of 4275201431 is 1341025724.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4275201431 is a prime.
It is a super-2 number, since 2×42752014312 = 36554694551248895522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 4275201394 and 4275201403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4275201439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 421055 + ... + 431088.
It is an arithmetic number, because the mean of its divisors is an integer number (556023960).
Almost surely, 24275201431 is an apocalyptic number.
4275201431 is a deficient number, since it is larger than the sum of its proper divisors (172990249).
4275201431 is a wasteful number, since it uses less digits than its factorization.
4275201431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852345.
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 4275201431 is about 65385.0245163218. The cubic root of 4275201431 is about 1623.0012735382.
The spelling of 4275201431 in words is "four billion, two hundred seventy-five million, two hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •