Base | Representation |
---|---|
bin | 100000011001000101110… |
… | …110100110011011001001 |
3 | 21212210121022212012221201 |
4 | 200121011312212123021 |
5 | 242432234020003033 |
6 | 4422332203104201 |
7 | 316551326213461 |
oct | 40310566463311 |
9 | 7783538765851 |
10 | 2225965000393 |
11 | 7890322370a2 |
12 | 2bb4a7212061 |
13 | 131ba4cc13b4 |
14 | 79a47154ba1 |
15 | 3cd80be047d |
hex | 20645da66c9 |
2225965000393 has 4 divisors (see below), whose sum is σ = 2225969735620. Its totient is φ = 2225960265168.
The previous prime is 2225965000361. The next prime is 2225965000411. The reversal of 2225965000393 is 3930005695222.
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 1970887477689 + 255077522704 = 1403883^2 + 505052^2 .
It is a cyclic number.
It is not a de Polignac number, because 2225965000393 - 25 = 2225965000361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2225965040393) 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 3 ways as a sum of consecutive naturals, for example, 1573758 + ... + 2632231.
It is an arithmetic number, because the mean of its divisors is an integer number (556492433905).
Almost surely, 22225965000393 is an apocalyptic number.
It is an amenable number.
2225965000393 is a deficient number, since it is larger than the sum of its proper divisors (4735227).
2225965000393 is an equidigital number, since it uses as much as digits as its factorization.
2225965000393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4735226.
The product of its (nonzero) digits is 874800, while the sum is 46.
The spelling of 2225965000393 in words is "two trillion, two hundred twenty-five billion, nine hundred sixty-five million, three hundred ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •