Base | Representation |
---|---|
bin | 10011100110001100111… |
… | …111000101011010100001 |
3 | 11202202001011000211220121 |
4 | 103212030333011122201 |
5 | 134031010132024022 |
6 | 2510354430440241 |
7 | 166203144034360 |
oct | 23461477053241 |
9 | 4682034024817 |
10 | 1346690111137 |
11 | 47a1455067a8 |
12 | 198bb7963081 |
13 | 99cb9201a37 |
14 | 492744877d7 |
15 | 2506ce122c7 |
hex | 1398cfc56a1 |
1346690111137 has 32 divisors (see below), whose sum is σ = 1634558413824. Its totient is φ = 1083110400000.
The previous prime is 1346690111099. The next prime is 1346690111167. The reversal of 1346690111137 is 7311110966431.
It is a cyclic number.
It is not a de Polignac number, because 1346690111137 - 27 = 1346690111009 is a prime.
It is a super-2 number, since 2×13466901111372 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1346690111093 and 1346690111102.
It is not an unprimeable number, because it can be changed into a prime (1346690111167) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53698233 + ... + 53723305.
It is an arithmetic number, because the mean of its divisors is an integer number (51079950432).
Almost surely, 21346690111137 is an apocalyptic number.
1346690111137 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1346690111137 is a deficient number, since it is larger than the sum of its proper divisors (287868302687).
1346690111137 is a wasteful number, since it uses less digits than its factorization.
1346690111137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26449.
The product of its (nonzero) digits is 81648, while the sum is 43.
The spelling of 1346690111137 in words is "one trillion, three hundred forty-six billion, six hundred ninety million, one hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •