Base | Representation |
---|---|
bin | 100111000010110… |
… | …1000111101110001 |
3 | 10101022012001012122 |
4 | 1032011220331301 |
5 | 10140341220421 |
6 | 334000004025 |
7 | 44315451332 |
oct | 11605507561 |
9 | 3338161178 |
10 | 1310101361 |
11 | 6125775a8 |
12 | 306900615 |
13 | 17b563a0a |
14 | c5dd0289 |
15 | 7a0382ab |
hex | 4e168f71 |
1310101361 has 4 divisors (see below), whose sum is σ = 1355277300. Its totient is φ = 1264925424.
The previous prime is 1310101343. The next prime is 1310101363. The reversal of 1310101361 is 1631010131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1631010131 = 61 ⋅26737871.
It can be written as a sum of positive squares in 2 ways, for example, as 322884961 + 987216400 = 17969^2 + 31420^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310101361 - 26 = 1310101297 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1310101363) 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, 22587926 + ... + 22587983.
It is an arithmetic number, because the mean of its divisors is an integer number (338819325).
Almost surely, 21310101361 is an apocalyptic number.
It is an amenable number.
1310101361 is a deficient number, since it is larger than the sum of its proper divisors (45175939).
1310101361 is an equidigital number, since it uses as much as digits as its factorization.
1310101361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45175938.
The product of its (nonzero) digits is 54, while the sum is 17.
The square root of 1310101361 is about 36195.3223635320. The cubic root of 1310101361 is about 1094.2124013998.
Adding to 1310101361 its reverse (1631010131), we get a palindrome (2941111492).
The spelling of 1310101361 in words is "one billion, three hundred ten million, one hundred one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •