Base | Representation |
---|---|
bin | 111101111000010111000… |
… | …011001110100011011101 |
3 | 120001112012100222221102012 |
4 | 331320113003032203131 |
5 | 1024132411003020203 |
6 | 13013305543041005 |
7 | 616140354354164 |
oct | 75702703164335 |
9 | 16045170887365 |
10 | 4252404345053 |
11 | 139a486435947 |
12 | 588189740165 |
13 | 24b000034bb7 |
14 | 109b631c23db |
15 | 75934e07bd8 |
hex | 3de170ce8dd |
4252404345053 has 2 divisors, whose sum is σ = 4252404345054. Its totient is φ = 4252404345052.
The previous prime is 4252404345043. The next prime is 4252404345083. The reversal of 4252404345053 is 3505434042524.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2635369117924 + 1617035227129 = 1623382^2 + 1271627^2 .
It is a cyclic number.
It is not a de Polignac number, because 4252404345053 - 210 = 4252404344029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4252404345053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4252404345043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2126202172526 + 2126202172527.
It is an arithmetic number, because the mean of its divisors is an integer number (2126202172527).
Almost surely, 24252404345053 is an apocalyptic number.
It is an amenable number.
4252404345053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4252404345053 is an equidigital number, since it uses as much as digits as its factorization.
4252404345053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152000, while the sum is 41.
Adding to 4252404345053 its reverse (3505434042524), we get a palindrome (7757838387577).
The spelling of 4252404345053 in words is "four trillion, two hundred fifty-two billion, four hundred four million, three hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •