Base | Representation |
---|---|
bin | 10101101100100… |
… | …110101000100001 |
3 | 221100221211111012 |
4 | 111230212220201 |
5 | 1221141422423 |
6 | 100042030305 |
7 | 12010032431 |
oct | 2554465041 |
9 | 840854435 |
10 | 364014113 |
11 | 177527211 |
12 | a1aa8395 |
13 | 5a551b88 |
14 | 364b82c1 |
15 | 21e56078 |
hex | 15b26a21 |
364014113 has 4 divisors (see below), whose sum is σ = 372892548. Its totient is φ = 355135680.
The previous prime is 364014083. The next prime is 364014137. The reversal of 364014113 is 311410463.
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 53831569 + 310182544 = 7337^2 + 17612^2 .
It is a cyclic number.
It is not a de Polignac number, because 364014113 - 28 = 364013857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (364014163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4439156 + ... + 4439237.
It is an arithmetic number, because the mean of its divisors is an integer number (93223137).
Almost surely, 2364014113 is an apocalyptic number.
It is an amenable number.
364014113 is a deficient number, since it is larger than the sum of its proper divisors (8878435).
364014113 is an equidigital number, since it uses as much as digits as its factorization.
364014113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8878434.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 364014113 is about 19079.1538858514. The cubic root of 364014113 is about 714.0129258515.
Adding to 364014113 its reverse (311410463), we get a palindrome (675424576).
The spelling of 364014113 in words is "three hundred sixty-four million, fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •