Base | Representation |
---|---|
bin | 1111110110000000… |
… | …0101011011110001 |
3 | 101222101212011000020 |
4 | 3331200011123301 |
5 | 32202234442023 |
6 | 1542005314053 |
7 | 210252204342 |
oct | 37540053361 |
9 | 11871764006 |
10 | 4253046513 |
11 | 1892808881 |
12 | 9a8405929 |
13 | 52a18c991 |
14 | 2c4bc40c9 |
15 | 19d5abde3 |
hex | fd8056f1 |
4253046513 has 4 divisors (see below), whose sum is σ = 5670728688. Its totient is φ = 2835364340.
The previous prime is 4253046509. The next prime is 4253046517. The reversal of 4253046513 is 3156403524.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (4253046509) and next prime (4253046517).
It is a cyclic number.
It is not a de Polignac number, because 4253046513 - 22 = 4253046509 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4253046517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 708841083 + ... + 708841088.
It is an arithmetic number, because the mean of its divisors is an integer number (1417682172).
Almost surely, 24253046513 is an apocalyptic number.
It is an amenable number.
4253046513 is a deficient number, since it is larger than the sum of its proper divisors (1417682175).
4253046513 is a wasteful number, since it uses less digits than its factorization.
4253046513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1417682174.
The product of its (nonzero) digits is 43200, while the sum is 33.
The square root of 4253046513 is about 65215.3855543307. The cubic root of 4253046513 is about 1620.1928481745.
The spelling of 4253046513 in words is "four billion, two hundred fifty-three million, forty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •