Base | Representation |
---|---|
bin | 111010111101000101110… |
… | …010011111110101110101 |
3 | 112100022011210210011001012 |
4 | 322331011302133311311 |
5 | 1012334103201310103 |
6 | 12341053015242005 |
7 | 565461416346323 |
oct | 72750562376565 |
9 | 15308153704035 |
10 | 4051325025653 |
11 | 13221803a5044 |
12 | 555210679305 |
13 | 2350662261b9 |
14 | 100129a26d13 |
15 | 705b6d352d8 |
hex | 3af45c9fd75 |
4051325025653 has 2 divisors, whose sum is σ = 4051325025654. Its totient is φ = 4051325025652.
The previous prime is 4051325025611. The next prime is 4051325025661. The reversal of 4051325025653 is 3565205231504.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3161504475844 + 889820549809 = 1778062^2 + 943303^2 .
It is a cyclic number.
It is not a de Polignac number, because 4051325025653 - 26 = 4051325025589 is a prime.
It is a super-2 number, since 2×40513250256532 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4051325025653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4051325025053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2025662512826 + 2025662512827.
It is an arithmetic number, because the mean of its divisors is an integer number (2025662512827).
Almost surely, 24051325025653 is an apocalyptic number.
It is an amenable number.
4051325025653 is a deficient number, since it is larger than the sum of its proper divisors (1).
4051325025653 is an equidigital number, since it uses as much as digits as its factorization.
4051325025653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 4051325025653 in words is "four trillion, fifty-one billion, three hundred twenty-five million, twenty-five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •