Base | Representation |
---|---|
bin | 10011000110011001101… |
… | …101101110110000110110 |
3 | 11122110220102221222122000 |
4 | 103012121231232300312 |
5 | 133001042221133400 |
6 | 2442550243320130 |
7 | 163554030205215 |
oct | 23063155566066 |
9 | 4573812858560 |
10 | 1312543927350 |
11 | 4667129134a7 |
12 | 192468380046 |
13 | 96a06b54366 |
14 | 4775551507c |
15 | 242202d9600 |
hex | 13199b6ec36 |
1312543927350 has 72 divisors (see below), whose sum is σ = 3616903707960. Its totient is φ = 350000488800.
The previous prime is 1312543927291. The next prime is 1312543927379. The reversal of 1312543927350 is 537293452131.
1312543927350 is a `hidden beast` number, since 1 + 3 + 1 + 254 + 392 + 7 + 3 + 5 + 0 = 666.
It is a super-2 number, since 2×13125439273502 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 1312543927296 and 1312543927305.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 42078760 + ... + 42109940.
Almost surely, 21312543927350 is an apocalyptic number.
1312543927350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1312543927350 is an abundant number, since it is smaller than the sum of its proper divisors (2304359780610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312543927350 is an frugal number, since it uses more digits than its factorization.
1312543927350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62383 (or 31191 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 45.
The spelling of 1312543927350 in words is "one trillion, three hundred twelve billion, five hundred forty-three million, nine hundred twenty-seven thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •