Base | Representation |
---|---|
bin | 100111001110010… |
… | …0111000110110101 |
3 | 10101201111222102120 |
4 | 1032130213012311 |
5 | 10143411414221 |
6 | 334333030153 |
7 | 44420601321 |
oct | 11634470665 |
9 | 3351458376 |
10 | 1316123061 |
11 | 615a0a810 |
12 | 308925359 |
13 | 17c891856 |
14 | c6b1a981 |
15 | 7a8275c6 |
hex | 4e7271b5 |
1316123061 has 8 divisors (see below), whose sum is σ = 1914360864. Its totient is φ = 797650320.
The previous prime is 1316123057. The next prime is 1316123111. The reversal of 1316123061 is 1603216131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1316123061 - 22 = 1316123057 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1316121061) 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 7 ways as a sum of consecutive naturals, for example, 19941226 + ... + 19941291.
It is an arithmetic number, because the mean of its divisors is an integer number (239295108).
Almost surely, 21316123061 is an apocalyptic number.
1316123061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1316123061 is a deficient number, since it is larger than the sum of its proper divisors (598237803).
1316123061 is a wasteful number, since it uses less digits than its factorization.
1316123061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39882531.
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 1316123061 is about 36278.4103979212. The cubic root of 1316123061 is about 1095.8863047941.
Adding to 1316123061 its reverse (1603216131), we get a palindrome (2919339192).
The spelling of 1316123061 in words is "one billion, three hundred sixteen million, one hundred twenty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •