Base | Representation |
---|---|
bin | 100000101111111010001… |
… | …000001100000010000001 |
3 | 21222010211201200221101021 |
4 | 200233322020030002001 |
5 | 243332422333034431 |
6 | 4441503221105441 |
7 | 321406414214656 |
oct | 40577210140201 |
9 | 7863751627337 |
10 | 2250464346241 |
11 | 7984644aa261 |
12 | 3041a3b58281 |
13 | 1342aa8a3b47 |
14 | 7acccc15c2d |
15 | 3d81696ab11 |
hex | 20bfa20c081 |
2250464346241 has 4 divisors (see below), whose sum is σ = 2256912668500. Its totient is φ = 2244016023984.
The previous prime is 2250464346223. The next prime is 2250464346269. The reversal of 2250464346241 is 1426434640522.
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 2055280640625 + 195183705616 = 1433625^2 + 441796^2 .
It is a cyclic number.
It is not a de Polignac number, because 2250464346241 - 29 = 2250464345729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2250464344241) 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, 3224160606 + ... + 3224161303.
It is an arithmetic number, because the mean of its divisors is an integer number (564228167125).
Almost surely, 22250464346241 is an apocalyptic number.
It is an amenable number.
2250464346241 is a deficient number, since it is larger than the sum of its proper divisors (6448322259).
2250464346241 is an equidigital number, since it uses as much as digits as its factorization.
2250464346241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6448322258.
The product of its (nonzero) digits is 1105920, while the sum is 43.
Adding to 2250464346241 its reverse (1426434640522), we get a palindrome (3676898986763).
The spelling of 2250464346241 in words is "two trillion, two hundred fifty billion, four hundred sixty-four million, three hundred forty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •