Base | Representation |
---|---|
bin | 10100011011001010… |
… | …00001101001011001 |
3 | 1001022012000022012001 |
4 | 22031211001221121 |
5 | 134424044244441 |
6 | 5012022521001 |
7 | 535504621051 |
oct | 121545015131 |
9 | 31265008161 |
10 | 10965228121 |
11 | 4717649201 |
12 | 2160296161 |
13 | 1059971683 |
14 | 76041c561 |
15 | 4429c1731 |
hex | 28d941a59 |
10965228121 has 4 divisors (see below), whose sum is σ = 11062265652. Its totient is φ = 10868190592.
The previous prime is 10965228119. The next prime is 10965228139. The reversal of 10965228121 is 12182256901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 12182256901 = 157 ⋅77593993.
It can be written as a sum of positive squares in 2 ways, for example, as 5612257225 + 5352970896 = 74915^2 + 73164^2 .
It is a cyclic number.
It is not a de Polignac number, because 10965228121 - 21 = 10965228119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10965228101) 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, 48518596 + ... + 48518821.
It is an arithmetic number, because the mean of its divisors is an integer number (2765566413).
Almost surely, 210965228121 is an apocalyptic number.
It is an amenable number.
10965228121 is a deficient number, since it is larger than the sum of its proper divisors (97037531).
10965228121 is an equidigital number, since it uses as much as digits as its factorization.
10965228121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97037530.
The product of its (nonzero) digits is 17280, while the sum is 37.
It can be divided in two parts, 10965 and 228121, that added together give a triangular number (239086 = T691).
The spelling of 10965228121 in words is "ten billion, nine hundred sixty-five million, two hundred twenty-eight thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •