Base | Representation |
---|---|
bin | 1111100000110101… |
… | …0010000010111001 |
3 | 101202012201212111212 |
4 | 3320031102002321 |
5 | 32012020400403 |
6 | 1525113532505 |
7 | 205123245122 |
oct | 37015220271 |
9 | 11665655455 |
10 | 4164231353 |
11 | 1847666717 |
12 | 982714135 |
13 | 514964129 |
14 | 2b70a5049 |
15 | 1958b64d8 |
hex | f83520b9 |
4164231353 has 4 divisors (see below), whose sum is σ = 4169195520. Its totient is φ = 4159267188.
The previous prime is 4164231319. The next prime is 4164231367. The reversal of 4164231353 is 3531324614.
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 a cyclic number.
It is not a de Polignac number, because 4164231353 - 214 = 4164214969 is a prime.
It is a super-2 number, since 2×41642313532 = 34681645522616421218, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4164231553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2480825 + ... + 2482502.
It is an arithmetic number, because the mean of its divisors is an integer number (1042298880).
Almost surely, 24164231353 is an apocalyptic number.
It is an amenable number.
4164231353 is a deficient number, since it is larger than the sum of its proper divisors (4964167).
4164231353 is an equidigital number, since it uses as much as digits as its factorization.
4164231353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4964166.
The product of its digits is 25920, while the sum is 32.
The square root of 4164231353 is about 64530.8558210721. The cubic root of 4164231353 is about 1608.8354106456.
Adding to 4164231353 its reverse (3531324614), we get a palindrome (7695555967).
The spelling of 4164231353 in words is "four billion, one hundred sixty-four million, two hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •