Base | Representation |
---|---|
bin | 1010011110100100… |
… | …01111101000110001 |
3 | 112112000201020010221 |
4 | 11033102033220301 |
5 | 43010014300001 |
6 | 2330102253041 |
7 | 256252662142 |
oct | 51722175061 |
9 | 15460636127 |
10 | 5625150001 |
11 | 24272834a9 |
12 | 110ba27181 |
13 | 6b8521a33 |
14 | 3b5113ac9 |
15 | 22dc911a1 |
hex | 14f48fa31 |
5625150001 has 9 divisors (see below), whose sum is σ = 5670283801. Its totient is φ = 5580374404.
The previous prime is 5625149983. The next prime is 5625150053. The reversal of 5625150001 is 1000515265.
The square root of 5625150001 is 75001.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 5625150001 - 29 = 5625149489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5625150061) 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 8 ways as a sum of consecutive naturals, for example, 13424970 + ... + 13425388.
Almost surely, 25625150001 is an apocalyptic number.
5625150001 is the 75001-st square number.
5625150001 is the 37501-st centered octagonal number.
It is an amenable number.
5625150001 is a deficient number, since it is larger than the sum of its proper divisors (45133800).
5625150001 is an frugal number, since it uses more digits than its factorization.
5625150001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196 (or 598 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The cubic root of 5625150001 is about 1778.4624606246.
Multiplying 5625150001 by its sum of digits (25), we get a square (140628750025 = 3750052).
Adding to 5625150001 its reverse (1000515265), we get a palindrome (6625665266).
The spelling of 5625150001 in words is "five billion, six hundred twenty-five million, one hundred fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •