Base | Representation |
---|---|
bin | 111110101011011001… |
… | …001011100010100001 |
3 | 20102201020211221201001 |
4 | 332223121023202201 |
5 | 2100312300423431 |
6 | 50530040512001 |
7 | 4601520453025 |
oct | 765331134241 |
9 | 212636757631 |
10 | 67300014241 |
11 | 265a6115889 |
12 | 1106277b601 |
13 | 6466c67545 |
14 | 33861c8385 |
15 | 1b3d57ee61 |
hex | fab64b8a1 |
67300014241 has 8 divisors (see below), whose sum is σ = 67667734664. Its totient is φ = 66932490240.
The previous prime is 67300014203. The next prime is 67300014251. The reversal of 67300014241 is 14241000376.
It can be written as a sum of positive squares in 4 ways, for example, as 5562176400 + 61737837841 = 74580^2 + 248471^2 .
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 67300014241 - 27 = 67300014113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (67300014251) 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 7 ways as a sum of consecutive naturals, for example, 666361 + ... + 760681.
It is an arithmetic number, because the mean of its divisors is an integer number (8458466833).
Almost surely, 267300014241 is an apocalyptic number.
It is an amenable number.
67300014241 is a deficient number, since it is larger than the sum of its proper divisors (367720423).
67300014241 is a wasteful number, since it uses less digits than its factorization.
67300014241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98211.
The product of its (nonzero) digits is 4032, while the sum is 28.
It can be divided in two parts, 673000 and 14241, that added together give a square (687241 = 8292).
The spelling of 67300014241 in words is "sixty-seven billion, three hundred million, fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •