Base | Representation |
---|---|
bin | 10011111101010101100… |
… | …101100011111001011001 |
3 | 11212010011022120012001110 |
4 | 103331111211203321121 |
5 | 134432343300232040 |
6 | 2530023350010533 |
7 | 201042542462463 |
oct | 23752545437131 |
9 | 4763138505043 |
10 | 1371530477145 |
11 | 489732220404 |
12 | 1a198a946a49 |
13 | 9c44764526a |
14 | 4a54d559133 |
15 | 25a23aa0980 |
hex | 13f55963e59 |
1371530477145 has 8 divisors (see below), whose sum is σ = 2194448763456. Its totient is φ = 731482921136.
The previous prime is 1371530477113. The next prime is 1371530477159. The reversal of 1371530477145 is 5417740351731.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1371530477145 - 25 = 1371530477113 is a prime.
It is a super-3 number, since 3×13715304771453 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1371530477094 and 1371530477103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45717682557 + ... + 45717682586.
It is an arithmetic number, because the mean of its divisors is an integer number (274306095432).
Almost surely, 21371530477145 is an apocalyptic number.
1371530477145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1371530477145 is a deficient number, since it is larger than the sum of its proper divisors (822918286311).
1371530477145 is an equidigital number, since it uses as much as digits as its factorization.
1371530477145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91435365151.
The product of its (nonzero) digits is 1234800, while the sum is 48.
The spelling of 1371530477145 in words is "one trillion, three hundred seventy-one billion, five hundred thirty million, four hundred seventy-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •