Base | Representation |
---|---|
bin | 1001000111001111… |
… | …01111111111111111 |
3 | 110121222021022211222 |
4 | 10203213233333333 |
5 | 40010000340304 |
6 | 2125253103555 |
7 | 232146221006 |
oct | 44347577777 |
9 | 13558238758 |
10 | 4892590079 |
11 | 2090815383 |
12 | b46627bbb |
13 | 5cc822420 |
14 | 345b01c3d |
15 | 1d97db4be |
hex | 1239effff |
4892590079 has 8 divisors (see below), whose sum is σ = 5546256240. Its totient is φ = 4278540096.
The previous prime is 4892590063. The next prime is 4892590091. The reversal of 4892590079 is 9700952984.
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 4892590079 - 24 = 4892590063 is a prime.
It is a super-2 number, since 2×48925900792 = 47874875362258452482, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 16.
It is a self number, because there is not a number n which added to its sum of digits gives 4892590079.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4892590019) 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, 9903782 + ... + 9904275.
It is an arithmetic number, because the mean of its divisors is an integer number (693282030).
Almost surely, 24892590079 is an apocalyptic number.
4892590079 is a deficient number, since it is larger than the sum of its proper divisors (653666161).
4892590079 is a wasteful number, since it uses less digits than its factorization.
4892590079 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19808089.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The square root of 4892590079 is about 69947.0519678993. The cubic root of 4892590079 is about 1697.6426471542.
The spelling of 4892590079 in words is "four billion, eight hundred ninety-two million, five hundred ninety thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •