Base | Representation |
---|---|
bin | 1001111001100011… |
… | …10000110100001101 |
3 | 111201101102221201101 |
4 | 10330301300310031 |
5 | 41341022122021 |
6 | 2235211143101 |
7 | 245462511412 |
oct | 47461606415 |
9 | 14641387641 |
10 | 5314645261 |
11 | 2287a84712 |
12 | 1043a44a91 |
13 | 6690b6713 |
14 | 385ba8109 |
15 | 2118a9a91 |
hex | 13cc70d0d |
5314645261 has 4 divisors (see below), whose sum is σ = 5344008124. Its totient is φ = 5285282400.
The previous prime is 5314645223. The next prime is 5314645277. The reversal of 5314645261 is 1625464135.
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 1153621225 + 4161024036 = 33965^2 + 64506^2 .
It is a cyclic number.
It is not a de Polignac number, because 5314645261 - 227 = 5180427533 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 5314645261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5314645291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14681160 + ... + 14681521.
It is an arithmetic number, because the mean of its divisors is an integer number (1336002031).
Almost surely, 25314645261 is an apocalyptic number.
It is an amenable number.
5314645261 is a deficient number, since it is larger than the sum of its proper divisors (29362863).
5314645261 is a wasteful number, since it uses less digits than its factorization.
5314645261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29362862.
The product of its digits is 86400, while the sum is 37.
The square root of 5314645261 is about 72901.6135692482. The cubic root of 5314645261 is about 1745.1178494202.
The spelling of 5314645261 in words is "five billion, three hundred fourteen million, six hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •