Base | Representation |
---|---|
bin | 1001000111100010110111… |
… | …1100100110110100001011 |
3 | 1022111101212010122012120002 |
4 | 2101320231330212310023 |
5 | 2303223124434444321 |
6 | 33153305150153215 |
7 | 2053204260333521 |
oct | 221705574466413 |
9 | 38441763565502 |
10 | 10025224531211 |
11 | 321574598872a |
12 | 115ab574b280b |
13 | 5794b4057a36 |
14 | 26931b242311 |
15 | 125ba46b820b |
hex | 91e2df26d0b |
10025224531211 has 8 divisors (see below), whose sum is σ = 10049921756160. Its totient is φ = 10000535764968.
The previous prime is 10025224531199. The next prime is 10025224531237. The reversal of 10025224531211 is 11213542252001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10025224531211 - 222 = 10025220336907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10025224531291) 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, 261920 + ... + 4485426.
It is an arithmetic number, because the mean of its divisors is an integer number (1256240219520).
Almost surely, 210025224531211 is an apocalyptic number.
10025224531211 is a deficient number, since it is larger than the sum of its proper divisors (24697224949).
10025224531211 is an equidigital number, since it uses as much as digits as its factorization.
10025224531211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4229353.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 10025224531211 its reverse (11213542252001), we get a palindrome (21238766783212).
The spelling of 10025224531211 in words is "ten trillion, twenty-five billion, two hundred twenty-four million, five hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •