Base | Representation |
---|---|
bin | 1001110111011000… |
… | …01101110000000101 |
3 | 111200010010200201102 |
4 | 10323230031300011 |
5 | 41321340214301 |
6 | 2233320305445 |
7 | 245151526235 |
oct | 47354156005 |
9 | 14603120642 |
10 | 5296413701 |
11 | 2278762007 |
12 | 1039912285 |
13 | 6653a2207 |
14 | 3835bdcc5 |
15 | 20eea7b6b |
hex | 13bb0dc05 |
5296413701 has 4 divisors (see below), whose sum is σ = 5298307404. Its totient is φ = 5294520000.
The previous prime is 5296413677. The next prime is 5296413721. The reversal of 5296413701 is 1073146925.
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 4385883076 + 910530625 = 66226^2 + 30175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5296413701 is a prime.
It is a super-3 number, since 3×52964137013 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5296413721) 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, 942650 + ... + 948251.
It is an arithmetic number, because the mean of its divisors is an integer number (1324576851).
Almost surely, 25296413701 is an apocalyptic number.
It is an amenable number.
5296413701 is a deficient number, since it is larger than the sum of its proper divisors (1893703).
5296413701 is a wasteful number, since it uses less digits than its factorization.
5296413701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1893702.
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 5296413701 is about 72776.4639220676. The cubic root of 5296413701 is about 1743.1200571627.
The spelling of 5296413701 in words is "five billion, two hundred ninety-six million, four hundred thirteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •