Base | Representation |
---|---|
bin | 10011101000010011101… |
… | …000001010101011101110 |
3 | 11202221212120120200201001 |
4 | 103220103220022223232 |
5 | 134100121422340231 |
6 | 2511410523110514 |
7 | 166313133355510 |
oct | 23502350125356 |
9 | 4687776520631 |
10 | 1348949027566 |
11 | 4800a4617088 |
12 | 19952837243a |
13 | 9a2891c108a |
14 | 4940a49dbb0 |
15 | 251513bab61 |
hex | 13a13a0aaee |
1348949027566 has 96 divisors (see below), whose sum is σ = 2484085008384. Its totient is φ = 538021440000.
The previous prime is 1348949027539. The next prime is 1348949027597. The reversal of 1348949027566 is 6657209498431.
It is a junction number, because it is equal to n+sod(n) for n = 1348949027498 and 1348949027507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 404966521 + ... + 404969851.
It is an arithmetic number, because the mean of its divisors is an integer number (25875885504).
It is a 1-persistent number, because it is pandigital, but 2⋅1348949027566 = 2697898055132 is not.
Almost surely, 21348949027566 is an apocalyptic number.
1348949027566 is a deficient number, since it is larger than the sum of its proper divisors (1135135980818).
1348949027566 is a wasteful number, since it uses less digits than its factorization.
1348949027566 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4466 (or 4449 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 64.
The spelling of 1348949027566 in words is "one trillion, three hundred forty-eight billion, nine hundred forty-nine million, twenty-seven thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •