Base | Representation |
---|---|
bin | 100111001111010… |
… | …0000010001100001 |
3 | 10101202110012020001 |
4 | 1032132200101201 |
5 | 10144023304421 |
6 | 334351420001 |
7 | 44425036261 |
oct | 11636402141 |
9 | 3352405201 |
10 | 1316619361 |
11 | 616219682 |
12 | 308b24601 |
13 | 17ca06715 |
14 | c6c097a1 |
15 | 7a8c4691 |
hex | 4e7a0461 |
1316619361 has 4 divisors (see below), whose sum is σ = 1317280000. Its totient is φ = 1315958724.
The previous prime is 1316619341. The next prime is 1316619373. The reversal of 1316619361 is 1639166131.
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 1316619361 - 25 = 1316619329 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1316619361.
It is not an unprimeable number, because it can be changed into a prime (1316619301) 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, 327321 + ... + 331318.
It is an arithmetic number, because the mean of its divisors is an integer number (329320000).
Almost surely, 21316619361 is an apocalyptic number.
It is an amenable number.
1316619361 is a deficient number, since it is larger than the sum of its proper divisors (660639).
1316619361 is an equidigital number, since it uses as much as digits as its factorization.
1316619361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660638.
The product of its digits is 17496, while the sum is 37.
The square root of 1316619361 is about 36285.2499095707. The cubic root of 1316619361 is about 1096.0240376142.
The spelling of 1316619361 in words is "one billion, three hundred sixteen million, six hundred nineteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •