Base | Representation |
---|---|
bin | 10011110100100000101… |
… | …000100001010110110011 |
3 | 11211012200202101001210220 |
4 | 103310200220201112303 |
5 | 134303440321014011 |
6 | 2521415040024123 |
7 | 200255631022164 |
oct | 23644050412663 |
9 | 4735622331726 |
10 | 1362052126131 |
11 | 485708a09a64 |
12 | 19bb84602043 |
13 | 9b596a4ca38 |
14 | 49cd07c576b |
15 | 2566b8d5506 |
hex | 13d20a215b3 |
1362052126131 has 4 divisors (see below), whose sum is σ = 1816069501512. Its totient is φ = 908034750752.
The previous prime is 1362052126103. The next prime is 1362052126153. The reversal of 1362052126131 is 1316212502631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1362052126131 is a prime.
It is a super-2 number, since 2×13620521261312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1362052126092 and 1362052126101.
It is not an unprimeable number, because it can be changed into a prime (1362052124131) 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, 227008687686 + ... + 227008687691.
It is an arithmetic number, because the mean of its divisors is an integer number (454017375378).
Almost surely, 21362052126131 is an apocalyptic number.
1362052126131 is a deficient number, since it is larger than the sum of its proper divisors (454017375381).
1362052126131 is an equidigital number, since it uses as much as digits as its factorization.
1362052126131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 454017375380.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 1362052126131 its reverse (1316212502631), we get a palindrome (2678264628762).
The spelling of 1362052126131 in words is "one trillion, three hundred sixty-two billion, fifty-two million, one hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •