Base | Representation |
---|---|
bin | 1001010011001100011001… |
… | …1111010011111001100101 |
3 | 1100012112102101021020200121 |
4 | 2110303012133103321211 |
5 | 2320013010134324341 |
6 | 33425243442041541 |
7 | 2103520522065316 |
oct | 224630637237145 |
9 | 40175371236617 |
10 | 10225352261221 |
11 | 3292602860319 |
12 | 11918a99492b1 |
13 | 5923289793a6 |
14 | 274ca429260d |
15 | 12aeb8e6d4d1 |
hex | 94cc67d3e65 |
10225352261221 has 4 divisors (see below), whose sum is σ = 10330768264012. Its totient is φ = 10119936258432.
The previous prime is 10225352261203. The next prime is 10225352261227. The reversal of 10225352261221 is 12216225352201.
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 6658206122500 + 3567146138721 = 2580350^2 + 1888689^2 .
It is a cyclic number.
It is not a de Polignac number, because 10225352261221 - 29 = 10225352260709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10225352261227) 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, 52708001250 + ... + 52708001443.
It is an arithmetic number, because the mean of its divisors is an integer number (2582692066003).
Almost surely, 210225352261221 is an apocalyptic number.
It is an amenable number.
10225352261221 is a deficient number, since it is larger than the sum of its proper divisors (105416002791).
10225352261221 is an equidigital number, since it uses as much as digits as its factorization.
10225352261221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105416002790.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 10225352261221 in words is "ten trillion, two hundred twenty-five billion, three hundred fifty-two million, two hundred sixty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •