Base | Representation |
---|---|
bin | 100100100011111100110… |
… | …0101111101000100110101 |
3 | 122210101102012000101200111 |
4 | 1021013321211331010311 |
5 | 1124312202041322201 |
6 | 14404242144143021 |
7 | 1026021201224365 |
oct | 111077145750465 |
9 | 18711365011614 |
10 | 5025004245301 |
11 | 16681019930a7 |
12 | 691a67907a71 |
13 | 2a5b18455ba1 |
14 | 1352d65169a5 |
15 | 8aaa2981b51 |
hex | 491f997d135 |
5025004245301 has 4 divisors (see below), whose sum is σ = 5025050370604. Its totient is φ = 5024958120000.
The previous prime is 5025004245299. The next prime is 5025004245329. The reversal of 5025004245301 is 1035424005205.
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 1947783096900 + 3077221148401 = 1395630^2 + 1754201^2 .
It is a cyclic number.
It is not a de Polignac number, because 5025004245301 - 21 = 5025004245299 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 (5025004245361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22898850 + ... + 23117251.
It is an arithmetic number, because the mean of its divisors is an integer number (1256262592651).
Almost surely, 25025004245301 is an apocalyptic number.
It is an amenable number.
5025004245301 is a deficient number, since it is larger than the sum of its proper divisors (46125303).
5025004245301 is a wasteful number, since it uses less digits than its factorization.
5025004245301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46125302.
The product of its (nonzero) digits is 24000, while the sum is 31.
The spelling of 5025004245301 in words is "five trillion, twenty-five billion, four million, two hundred forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •