Base | Representation |
---|---|
bin | 10011110011110101011… |
… | …010011111010110100111 |
3 | 11211010211012222020122121 |
4 | 103303311122133112213 |
5 | 134300444204340443 |
6 | 2521215054410411 |
7 | 200231644545313 |
oct | 23636532372647 |
9 | 4733735866577 |
10 | 1361327027623 |
11 | 4853766877a2 |
12 | 19ba01800a07 |
13 | 9b4ac763674 |
14 | 49c62396b43 |
15 | 25627e064ed |
hex | 13cf569f5a7 |
1361327027623 has 4 divisors (see below), whose sum is σ = 1361754986488. Its totient is φ = 1360899068760.
The previous prime is 1361327027587. The next prime is 1361327027663. The reversal of 1361327027623 is 3267207231631.
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-1361327027623 is a prime.
It is a super-2 number, since 2×13613270276232 (a number of 25 digits) contains 22 as substring.
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 1361327027623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1361327027663) 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, 213974661 + ... + 213981022.
It is an arithmetic number, because the mean of its divisors is an integer number (340438746622).
Almost surely, 21361327027623 is an apocalyptic number.
1361327027623 is a deficient number, since it is larger than the sum of its proper divisors (427958865).
1361327027623 is an equidigital number, since it uses as much as digits as its factorization.
1361327027623 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 427958864.
The product of its (nonzero) digits is 381024, while the sum is 43.
The spelling of 1361327027623 in words is "one trillion, three hundred sixty-one billion, three hundred twenty-seven million, twenty-seven thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •