Base | Representation |
---|---|
bin | 10011000100001010100… |
… | …011111111011100000001 |
3 | 11122020201001202020102021 |
4 | 103010022203333130001 |
5 | 132431132402413241 |
6 | 2441512050521441 |
7 | 163440355141666 |
oct | 23041243773401 |
9 | 4566631666367 |
10 | 1310142232321 |
11 | 4656a015347a |
12 | 191ab7b96281 |
13 | 967133c4040 |
14 | 475a8573a6d |
15 | 2412e52b0d1 |
hex | 1310a8ff701 |
1310142232321 has 16 divisors (see below), whose sum is σ = 1413666644544. Its totient is φ = 1207010516544.
The previous prime is 1310142232309. The next prime is 1310142232337. The reversal of 1310142232321 is 1232322410131.
It is a cyclic number.
It is not a de Polignac number, because 1310142232321 - 213 = 1310142224129 is a prime.
It is a super-2 number, since 2×13101422323212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310142233321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88354510 + ... + 88369336.
It is an arithmetic number, because the mean of its divisors is an integer number (88354165284).
Almost surely, 21310142232321 is an apocalyptic number.
It is an amenable number.
1310142232321 is a deficient number, since it is larger than the sum of its proper divisors (103524412223).
1310142232321 is a wasteful number, since it uses less digits than its factorization.
1310142232321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27600.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1310142232321 its reverse (1232322410131), we get a palindrome (2542464642452).
The spelling of 1310142232321 in words is "one trillion, three hundred ten billion, one hundred forty-two million, two hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •