Base | Representation |
---|---|
bin | 101000000001101… |
… | …1111011110100001 |
3 | 10110121021011201220 |
4 | 1100003133132201 |
5 | 10222312431031 |
6 | 341135045253 |
7 | 45166045662 |
oct | 12003373641 |
9 | 3417234656 |
10 | 1343092641 |
11 | 62a160420 |
12 | 315970829 |
13 | 185345397 |
14 | ca53b369 |
15 | 7cda3596 |
hex | 500df7a1 |
1343092641 has 8 divisors (see below), whose sum is σ = 1953589344. Its totient is φ = 813995520.
The previous prime is 1343092627. The next prime is 1343092649. The reversal of 1343092641 is 1462903431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1343092641 - 218 = 1342830497 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 40699777 = 1343092641 / (1 + 3 + 4 + 3 + 0 + 9 + 2 + 6 + 4 + 1).
It is not an unprimeable number, because it can be changed into a prime (1343092649) 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, 20349856 + ... + 20349921.
It is an arithmetic number, because the mean of its divisors is an integer number (244198668).
Almost surely, 21343092641 is an apocalyptic number.
1343092641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1343092641 is a deficient number, since it is larger than the sum of its proper divisors (610496703).
1343092641 is a wasteful number, since it uses less digits than its factorization.
1343092641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40699791.
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 1343092641 is about 36648.2283473567. The cubic root of 1343092641 is about 1103.3212679491.
The spelling of 1343092641 in words is "one billion, three hundred forty-three million, ninety-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •