Base | Representation |
---|---|
bin | 1111110110001000… |
… | …1110100001111101 |
3 | 101222102220200022022 |
4 | 3331202032201331 |
5 | 32202410424221 |
6 | 1542025325525 |
7 | 210260033453 |
oct | 37542164175 |
9 | 11872820268 |
10 | 4253608061 |
11 | 189306176a |
12 | 9a86368a5 |
13 | 52a328461 |
14 | 2c4ccc9d3 |
15 | 19d66d4ab |
hex | fd88e87d |
4253608061 has 4 divisors (see below), whose sum is σ = 4301401500. Its totient is φ = 4205814624.
The previous prime is 4253608049. The next prime is 4253608081. The reversal of 4253608061 is 1608063524.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1019524900 + 3234083161 = 31930^2 + 56869^2 .
It is a cyclic number.
It is not a de Polignac number, because 4253608061 - 210 = 4253607037 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 (4253608001) 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, 23896586 + ... + 23896763.
It is an arithmetic number, because the mean of its divisors is an integer number (1075350375).
Almost surely, 24253608061 is an apocalyptic number.
It is an amenable number.
4253608061 is a deficient number, since it is larger than the sum of its proper divisors (47793439).
4253608061 is an equidigital number, since it uses as much as digits as its factorization.
4253608061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47793438.
The product of its (nonzero) digits is 34560, while the sum is 35.
The square root of 4253608061 is about 65219.6907459703. The cubic root of 4253608061 is about 1620.2641520435.
The spelling of 4253608061 in words is "four billion, two hundred fifty-three million, six hundred eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •