Base | Representation |
---|---|
bin | 10011100111111011001… |
… | …001110110011001010001 |
3 | 11202220210221222000120020 |
4 | 103213323021312121101 |
5 | 134043301314130321 |
6 | 2511302054334053 |
7 | 166300016333265 |
oct | 23477311663121 |
9 | 4686727860506 |
10 | 1348538426961 |
11 | 47aa03870840 |
12 | 19943295a329 |
13 | 9a22210a73b |
14 | 493abb3a0a5 |
15 | 2512a3114c6 |
hex | 139fb276651 |
1348538426961 has 32 divisors (see below), whose sum is σ = 1981179313152. Its totient is φ = 809105664960.
The previous prime is 1348538426959. The next prime is 1348538426993. The reversal of 1348538426961 is 1696248358431.
It is a happy number.
It is not a de Polignac number, because 1348538426961 - 21 = 1348538426959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1348538426895 and 1348538426904.
It is not an unprimeable number, because it can be changed into a prime (1348538426161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10995966 + ... + 11117928.
It is an arithmetic number, because the mean of its divisors is an integer number (61911853536).
Almost surely, 21348538426961 is an apocalyptic number.
1348538426961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1348538426961 is a deficient number, since it is larger than the sum of its proper divisors (632640886191).
1348538426961 is a wasteful number, since it uses less digits than its factorization.
1348538426961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125333.
The product of its digits is 29859840, while the sum is 60.
The spelling of 1348538426961 in words is "one trillion, three hundred forty-eight billion, five hundred thirty-eight million, four hundred twenty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •