Base | Representation |
---|---|
bin | 1111111110110111… |
… | …1101001001000101 |
3 | 102001222211121202120 |
4 | 3333231331021011 |
5 | 32241300040442 |
6 | 1545414400153 |
7 | 211213261404 |
oct | 37755751105 |
9 | 12058747676 |
10 | 4290236997 |
11 | 19017aa612 |
12 | 9b8960059 |
13 | 534ab1797 |
14 | 2c9b0563b |
15 | 1a19a64ec |
hex | ffb7d245 |
4290236997 has 8 divisors (see below), whose sum is σ = 5727236256. Its totient is φ = 2856697872.
The previous prime is 4290236969. The next prime is 4290237023. The reversal of 4290236997 is 7996320924.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4290236997 - 215 = 4290204229 is a prime.
It is a super-2 number, since 2×42902369972 = 36812266980855156018, which contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4290236927) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 862138 + ... + 867099.
It is an arithmetic number, because the mean of its divisors is an integer number (715904532).
Almost surely, 24290236997 is an apocalyptic number.
It is an amenable number.
4290236997 is a deficient number, since it is larger than the sum of its proper divisors (1436999259).
4290236997 is a wasteful number, since it uses less digits than its factorization.
4290236997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1730067.
The product of its (nonzero) digits is 1469664, while the sum is 51.
The square root of 4290236997 is about 65499.9007403828. The cubic root of 4290236997 is about 1624.9017057073.
The spelling of 4290236997 in words is "four billion, two hundred ninety million, two hundred thirty-six thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •