Base | Representation |
---|---|
bin | 1110010001111010001… |
… | …1100010111100010001 |
3 | 212110020011201101200122 |
4 | 3210132203202330101 |
5 | 13004411344124023 |
6 | 304411234400025 |
7 | 23503254433355 |
oct | 3443643427421 |
9 | 773204641618 |
10 | 245325770513 |
11 | 9505100247a |
12 | 3b667130015 |
13 | 1a198881c25 |
14 | bc33b11465 |
15 | 65ac7b22c8 |
hex | 391e8e2f11 |
245325770513 has 8 divisors (see below), whose sum is σ = 249960890400. Its totient is φ = 240706552608.
The previous prime is 245325770507. The next prime is 245325770531. The reversal of 245325770513 is 315077523542.
245325770513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 245325770513 - 26 = 245325770449 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (245325770593) 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 7 ways as a sum of consecutive naturals, for example, 3944348 + ... + 4006061.
It is an arithmetic number, because the mean of its divisors is an integer number (31245111300).
Almost surely, 2245325770513 is an apocalyptic number.
It is an amenable number.
245325770513 is a deficient number, since it is larger than the sum of its proper divisors (4635119887).
245325770513 is an equidigital number, since it uses as much as digits as its factorization.
245325770513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7950991.
The product of its (nonzero) digits is 882000, while the sum is 44.
The spelling of 245325770513 in words is "two hundred forty-five billion, three hundred twenty-five million, seven hundred seventy thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •