Base | Representation |
---|---|
bin | 1011010011011000… |
… | …11111100000111101 |
3 | 120122220110110011021 |
4 | 11221230133200331 |
5 | 44411432112042 |
6 | 2442051224141 |
7 | 303243114064 |
oct | 55154374075 |
9 | 16586413137 |
10 | 6068238397 |
11 | 26343a9361 |
12 | 12142a8051 |
13 | 75926b810 |
14 | 417cd31db |
15 | 257b16867 |
hex | 169b1f83d |
6068238397 has 8 divisors (see below), whose sum is σ = 6549332216. Its totient is φ = 5589188352.
The previous prime is 6068238361. The next prime is 6068238403. The reversal of 6068238397 is 7938328606.
It can be written as a sum of positive squares in 4 ways, for example, as 397244761 + 5670993636 = 19931^2 + 75306^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 6068238397 - 27 = 6068238269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6068238697) 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, 504768 + ... + 516649.
It is an arithmetic number, because the mean of its divisors is an integer number (818666527).
Almost surely, 26068238397 is an apocalyptic number.
It is an amenable number.
6068238397 is a deficient number, since it is larger than the sum of its proper divisors (481093819).
6068238397 is a wasteful number, since it uses less digits than its factorization.
6068238397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021887.
The product of its (nonzero) digits is 2612736, while the sum is 52.
The square root of 6068238397 is about 77898.8985608911. The cubic root of 6068238397 is about 1823.9833854617.
The spelling of 6068238397 in words is "six billion, sixty-eight million, two hundred thirty-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •