Base | Representation |
---|---|
bin | 1000001000111… |
… | …00001110010011 |
3 | 11202110122000020 |
4 | 10010130032103 |
5 | 114434214133 |
6 | 10435154523 |
7 | 1456211526 |
oct | 404341623 |
9 | 152418006 |
10 | 68273043 |
11 | 355a1603 |
12 | 1aa45a43 |
13 | 111b5767 |
14 | 90d2bbd |
15 | 5ed90b3 |
hex | 411c393 |
68273043 has 4 divisors (see below), whose sum is σ = 91030728. Its totient is φ = 45515360.
The previous prime is 68272987. The next prime is 68273069. The reversal of 68273043 is 34037286.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 68273043 - 210 = 68272019 is a prime.
It is a super-2 number, since 2×682730432 = 9322416800959698, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 68272995 and 68273013.
It is not an unprimeable number, because it can be changed into a prime (68273083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11378838 + ... + 11378843.
It is an arithmetic number, because the mean of its divisors is an integer number (22757682).
Almost surely, 268273043 is an apocalyptic number.
68273043 is a deficient number, since it is larger than the sum of its proper divisors (22757685).
68273043 is a wasteful number, since it uses less digits than its factorization.
68273043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22757684.
The product of its (nonzero) digits is 24192, while the sum is 33.
The square root of 68273043 is about 8262.7503290369. The cubic root of 68273043 is about 408.7110881418.
It can be divided in two parts, 6827 and 3043, that added together give a triangular number (9870 = T140).
The spelling of 68273043 in words is "sixty-eight million, two hundred seventy-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •