Base | Representation |
---|---|
bin | 1011011100101101… |
… | …0110000010101101 |
3 | 21221011202221220002 |
4 | 2313023112002231 |
5 | 22243220020042 |
6 | 1224541234045 |
7 | 136104543404 |
oct | 26713260255 |
9 | 7834687802 |
10 | 3073204397 |
11 | 133781aa4a |
12 | 719262925 |
13 | 39c905753 |
14 | 21222063b |
15 | 12ec04132 |
hex | b72d60ad |
3073204397 has 8 divisors (see below), whose sum is σ = 3130841280. Its totient is φ = 3016058400.
The previous prime is 3073204361. The next prime is 3073204403. The reversal of 3073204397 is 7934023703.
It is a happy number.
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 3073204397 - 26 = 3073204333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3073204397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3073204357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110072 + ... + 135137.
It is an arithmetic number, because the mean of its divisors is an integer number (391355160).
Almost surely, 23073204397 is an apocalyptic number.
It is an amenable number.
3073204397 is a deficient number, since it is larger than the sum of its proper divisors (57636883).
3073204397 is a wasteful number, since it uses less digits than its factorization.
3073204397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245443.
The product of its (nonzero) digits is 95256, while the sum is 38.
The square root of 3073204397 is about 55436.4897608065. The cubic root of 3073204397 is about 1453.8864264049.
The spelling of 3073204397 in words is "three billion, seventy-three million, two hundred four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •