Base | Representation |
---|---|
bin | 10011100101110100101… |
… | …101011010101010111111 |
3 | 11202200222202122122022212 |
4 | 103211310231122222333 |
5 | 134024141400421211 |
6 | 2510250201131035 |
7 | 166160100132404 |
oct | 23456455325277 |
9 | 4680882578285 |
10 | 1346282826431 |
11 | 479a56615774 |
12 | 198b03489a7b |
13 | 99c52a0c77a |
14 | 492363482ab |
15 | 250472b038b |
hex | 13974b5aabf |
1346282826431 has 8 divisors (see below), whose sum is σ = 1393133811600. Its totient is φ = 1299460337280.
The previous prime is 1346282826391. The next prime is 1346282826451.
1346282826431 is nontrivially palindromic in base 10.
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 1346282826431 - 230 = 1345209084607 is a prime.
It is a super-2 number, since 2×13462828264312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1346282826431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1346282826451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7027850 + ... + 7216871.
It is an arithmetic number, because the mean of its divisors is an integer number (174141726450).
Almost surely, 21346282826431 is an apocalyptic number.
1346282826431 is a deficient number, since it is larger than the sum of its proper divisors (46850985169).
1346282826431 is a wasteful number, since it uses less digits than its factorization.
1346282826431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14248009.
The product of its digits is 2654208, while the sum is 50.
The spelling of 1346282826431 in words is "one trillion, three hundred forty-six billion, two hundred eighty-two million, eight hundred twenty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •