Base | Representation |
---|---|
bin | 1111111111000… |
… | …0000000001101 |
3 | 11200011011011201 |
4 | 3333300000031 |
5 | 114130341331 |
6 | 10352545501 |
7 | 1442600431 |
oct | 377600015 |
9 | 150134151 |
10 | 67043341 |
11 | 34931722 |
12 | 1a552291 |
13 | 10b74b21 |
14 | 8c929c1 |
15 | 5d44a61 |
hex | 3ff000d |
67043341 has 2 divisors, whose sum is σ = 67043342. Its totient is φ = 67043340.
The previous prime is 67043329. The next prime is 67043369. The reversal of 67043341 is 14334076.
67043341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (67043369) can be obtained adding 67043341 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38378025 + 28665316 = 6195^2 + 5354^2 .
It is a cyclic number.
It is not a de Polignac number, because 67043341 - 213 = 67035149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (67046341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33521670 + 33521671.
It is an arithmetic number, because the mean of its divisors is an integer number (33521671).
Almost surely, 267043341 is an apocalyptic number.
It is an amenable number.
67043341 is a deficient number, since it is larger than the sum of its proper divisors (1).
67043341 is an equidigital number, since it uses as much as digits as its factorization.
67043341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 67043341 is about 8187.9998168051. Note that the first 3 decimals coincide. The cubic root of 67043341 is about 406.2423690559.
The spelling of 67043341 in words is "sixty-seven million, forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •