Base | Representation |
---|---|
bin | 1001101101011011… |
… | …00111111010000101 |
3 | 111110021222121012121 |
4 | 10312231213322011 |
5 | 41134000200101 |
6 | 2221134245541 |
7 | 243115615102 |
oct | 46655477205 |
9 | 14407877177 |
10 | 5212896901 |
11 | 22355a9663 |
12 | 10159568b1 |
13 | 650cb01a4 |
14 | 37647daa9 |
15 | 2079ac0a1 |
hex | 136b67e85 |
5212896901 has 4 divisors (see below), whose sum is σ = 5230688652. Its totient is φ = 5195105152.
The previous prime is 5212896889. The next prime is 5212896967. The reversal of 5212896901 is 1096982125.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4623864001 + 589032900 = 67999^2 + 24270^2 .
It is a cyclic number.
It is not a de Polignac number, because 5212896901 - 25 = 5212896869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5212896301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8895436 + ... + 8896021.
It is an arithmetic number, because the mean of its divisors is an integer number (1307672163).
Almost surely, 25212896901 is an apocalyptic number.
It is an amenable number.
5212896901 is a deficient number, since it is larger than the sum of its proper divisors (17791751).
5212896901 is a wasteful number, since it uses less digits than its factorization.
5212896901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17791750.
The product of its (nonzero) digits is 77760, while the sum is 43.
The square root of 5212896901 is about 72200.3940501712. The cubic root of 5212896901 is about 1733.9093102573.
The spelling of 5212896901 in words is "five billion, two hundred twelve million, eight hundred ninety-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •