Base | Representation |
---|---|
bin | 101000000110111… |
… | …1011111101010111 |
3 | 10110210102021201002 |
4 | 1100031323331113 |
5 | 10224013040433 |
6 | 341313453515 |
7 | 45231241535 |
oct | 12015737527 |
9 | 3423367632 |
10 | 1345830743 |
11 | 630760614 |
12 | 31687129b |
13 | 185a9376a |
14 | caa51155 |
15 | 7d2449e8 |
hex | 5037bf57 |
1345830743 has 6 divisors (see below), whose sum is σ = 1420392384. Its totient is φ = 1274997204.
The previous prime is 1345830613. The next prime is 1345830767. The reversal of 1345830743 is 3470385431.
It is not a de Polignac number, because 1345830743 - 220 = 1344782167 is a prime.
It is a super-2 number, since 2×13458307432 = 3622520777607864098, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1345830697 and 1345830706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345830793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1863671 + ... + 1864392.
It is an arithmetic number, because the mean of its divisors is an integer number (236732064).
Almost surely, 21345830743 is an apocalyptic number.
1345830743 is a deficient number, since it is larger than the sum of its proper divisors (74561641).
1345830743 is an equidigital number, since it uses as much as digits as its factorization.
1345830743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3728101 (or 3728082 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 38.
The square root of 1345830743 is about 36685.5658672454. The cubic root of 1345830743 is about 1104.0705226842.
The spelling of 1345830743 in words is "one billion, three hundred forty-five million, eight hundred thirty thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •