Base | Representation |
---|---|
bin | 11100011100100111101000… |
… | …011000111010011101100011 |
3 | 121101222120221110221011001102 |
4 | 130130213220120322131203 |
5 | 112344313334302211321 |
6 | 1122031354312025015 |
7 | 35232021010422011 |
oct | 3434475030723543 |
9 | 541876843834042 |
10 | 125112001210211 |
11 | 3695677a024714 |
12 | 1204766409216b |
13 | 54a701b499c92 |
14 | 22c764b6cb8b1 |
15 | e6e6b49c0c0b |
hex | 71c9e863a763 |
125112001210211 has 4 divisors (see below), whose sum is σ = 129147872217024. Its totient is φ = 121076130203400.
The previous prime is 125112001210193. The next prime is 125112001210223. The reversal of 125112001210211 is 112012100211521.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 125112001210211 - 234 = 125094821341027 is a prime.
It is a super-2 number, since 2×1251120012102112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125112003210211) 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, 2017935503360 + ... + 2017935503421.
It is an arithmetic number, because the mean of its divisors is an integer number (32286968054256).
Almost surely, 2125112001210211 is an apocalyptic number.
125112001210211 is a deficient number, since it is larger than the sum of its proper divisors (4035871006813).
125112001210211 is an equidigital number, since it uses as much as digits as its factorization.
125112001210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4035871006812.
The product of its (nonzero) digits is 80, while the sum is 20.
Adding to 125112001210211 its reverse (112012100211521), we get a palindrome (237124101421732).
The spelling of 125112001210211 in words is "one hundred twenty-five trillion, one hundred twelve billion, one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •