Base | Representation |
---|---|
bin | 1111011110010001… |
… | …0111011000100001 |
3 | 101201110112221011010 |
4 | 3313210113120201 |
5 | 32001244132223 |
6 | 1524052011133 |
7 | 204633132636 |
oct | 36744273041 |
9 | 11643487133 |
10 | 4153505313 |
11 | 1841600021 |
12 | 97b000aa9 |
13 | 512679c69 |
14 | 2b58b218d |
15 | 194998393 |
hex | f7917621 |
4153505313 has 4 divisors (see below), whose sum is σ = 5538007088. Its totient is φ = 2769003540.
The previous prime is 4153505269. The next prime is 4153505327. The reversal of 4153505313 is 3135053514.
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 not a de Polignac number, because 4153505313 - 29 = 4153504801 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4153505813) 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, 692250883 + ... + 692250888.
It is an arithmetic number, because the mean of its divisors is an integer number (1384501772).
Almost surely, 24153505313 is an apocalyptic number.
It is an amenable number.
4153505313 is a deficient number, since it is larger than the sum of its proper divisors (1384501775).
4153505313 is a wasteful number, since it uses less digits than its factorization.
4153505313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384501774.
The product of its (nonzero) digits is 13500, while the sum is 30.
The square root of 4153505313 is about 64447.6943963087. The cubic root of 4153505313 is about 1607.4529009772.
Adding to 4153505313 its reverse (3135053514), we get a palindrome (7288558827).
The spelling of 4153505313 in words is "four billion, one hundred fifty-three million, five hundred five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •