Base | Representation |
---|---|
bin | 1001010011001100011001… |
… | …1111010011111010010001 |
3 | 1100012112102101021020202020 |
4 | 2110303012133103322101 |
5 | 2320013010134330030 |
6 | 33425243442042053 |
7 | 2103520522065411 |
oct | 224630637237221 |
9 | 40175371236666 |
10 | 10225352261265 |
11 | 3292602860359 |
12 | 11918a9949329 |
13 | 59232897940b |
14 | 274ca4292641 |
15 | 12aeb8e6d510 |
hex | 94cc67d3e91 |
10225352261265 has 8 divisors (see below), whose sum is σ = 16360563618048. Its totient is φ = 5453521206000.
The previous prime is 10225352261261. The next prime is 10225352261407. The reversal of 10225352261265 is 56216225352201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10225352261265 - 22 = 10225352261261 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10225352261261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 340845075361 + ... + 340845075390.
It is an arithmetic number, because the mean of its divisors is an integer number (2045070452256).
Almost surely, 210225352261265 is an apocalyptic number.
10225352261265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10225352261265 is a deficient number, since it is larger than the sum of its proper divisors (6135211356783).
10225352261265 is an equidigital number, since it uses as much as digits as its factorization.
10225352261265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681690150759.
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 10225352261265 in words is "ten trillion, two hundred twenty-five billion, three hundred fifty-two million, two hundred sixty-one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •