Base | Representation |
---|---|
bin | 100101011111010010111… |
… | …1110001011111010000001 |
3 | 200020120101010022022110122 |
4 | 1022332211332023322001 |
5 | 1133404204241031431 |
6 | 14543000352110025 |
7 | 1041152344121264 |
oct | 112764576137201 |
9 | 20216333268418 |
10 | 5152450330241 |
11 | 1707161984025 |
12 | 6b26b5235315 |
13 | 2b4b491a1b76 |
14 | 13b546738cdb |
15 | 8e0614b9a7b |
hex | 4afa5f8be81 |
5152450330241 has 4 divisors (see below), whose sum is σ = 5152460476500. Its totient is φ = 5152440183984.
The previous prime is 5152450330199. The next prime is 5152450330253. The reversal of 5152450330241 is 1420330542515.
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 3629040240016 + 1523410090225 = 1905004^2 + 1234265^2 .
It is a cyclic number.
It is not a de Polignac number, because 5152450330241 - 242 = 754403819137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5152450330141) 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, 4268906 + ... + 5341203.
It is an arithmetic number, because the mean of its divisors is an integer number (1288115119125).
Almost surely, 25152450330241 is an apocalyptic number.
It is an amenable number.
5152450330241 is a deficient number, since it is larger than the sum of its proper divisors (10146259).
5152450330241 is an equidigital number, since it uses as much as digits as its factorization.
5152450330241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10146258.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 5152450330241 its reverse (1420330542515), we get a palindrome (6572780872756).
The spelling of 5152450330241 in words is "five trillion, one hundred fifty-two billion, four hundred fifty million, three hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •