Base | Representation |
---|---|
bin | 1001101110100011… |
… | …10001000010101101 |
3 | 111110221210221220201 |
4 | 10313101301002231 |
5 | 41143411342001 |
6 | 2222113313501 |
7 | 243262265614 |
oct | 46721610255 |
9 | 14427727821 |
10 | 5222371501 |
11 | 223a990006 |
12 | 1018b65891 |
13 | 652c49869 |
14 | 37782887b |
15 | 20872e501 |
hex | 1374710ad |
5222371501 has 8 divisors (see below), whose sum is σ = 5271458040. Its totient is φ = 5173335552.
The previous prime is 5222371471. The next prime is 5222371519. The reversal of 5222371501 is 1051732225.
It can be written as a sum of positive squares in 4 ways, for example, as 227557225 + 4994814276 = 15085^2 + 70674^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 5222371501 - 27 = 5222371373 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 5222371501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5222371201) 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, 213615 + ... + 236803.
It is an arithmetic number, because the mean of its divisors is an integer number (658932255).
Almost surely, 25222371501 is an apocalyptic number.
It is an amenable number.
5222371501 is a deficient number, since it is larger than the sum of its proper divisors (49086539).
5222371501 is a wasteful number, since it uses less digits than its factorization.
5222371501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25295.
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 5222371501 is about 72265.9774790323. The cubic root of 5222371501 is about 1734.9591522578.
The spelling of 5222371501 in words is "five billion, two hundred twenty-two million, three hundred seventy-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.279 sec. • engine limits •