Base | Representation |
---|---|
bin | 1111111011010000… |
… | …0110110100111001 |
3 | 102000221022011201121 |
4 | 3332310012310321 |
5 | 32223404303223 |
6 | 1544113345241 |
7 | 210640341451 |
oct | 37664066471 |
9 | 12027264647 |
10 | 4275072313 |
11 | 18a4192116 |
12 | 9b3868221 |
13 | 5319021b5 |
14 | 2c7ab8d61 |
15 | 1a04ad15d |
hex | fed06d39 |
4275072313 has 2 divisors, whose sum is σ = 4275072314. Its totient is φ = 4275072312.
The previous prime is 4275072311. The next prime is 4275072317. The reversal of 4275072313 is 3132705724.
4275072313 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3983755689 + 291316624 = 63117^2 + 17068^2 .
It is a cyclic number.
It is not a de Polignac number, because 4275072313 - 21 = 4275072311 is a prime.
Together with 4275072311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (4275072311) 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 as a sum of consecutive naturals, namely, 2137536156 + 2137536157.
It is an arithmetic number, because the mean of its divisors is an integer number (2137536157).
Almost surely, 24275072313 is an apocalyptic number.
It is an amenable number.
4275072313 is a deficient number, since it is larger than the sum of its proper divisors (1).
4275072313 is an equidigital number, since it uses as much as digits as its factorization.
4275072313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 34.
The square root of 4275072313 is about 65384.0371421037. The cubic root of 4275072313 is about 1622.9849342857.
The spelling of 4275072313 in words is "four billion, two hundred seventy-five million, seventy-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •