Base | Representation |
---|---|
bin | 11100011101001110001100… |
… | …010101101110010101110101 |
3 | 121102010112211002101000000122 |
4 | 130131032030111232111311 |
5 | 112401003134033340341 |
6 | 1122102403052021325 |
7 | 35235015041066420 |
oct | 3435161425562565 |
9 | 542115732330018 |
10 | 125153406543221 |
11 | 369722972841a1 |
12 | 1205369a761845 |
13 | 54aabb9747524 |
14 | 22c96587989b7 |
15 | e707d9a5294b |
hex | 71d38c56e575 |
125153406543221 has 4 divisors (see below), whose sum is σ = 143032464620832. Its totient is φ = 107274348465612.
The previous prime is 125153406543211. The next prime is 125153406543227. The reversal of 125153406543221 is 122345604351521.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 125153406543221 - 218 = 125153406281077 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 (125153406543227) 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, 8939529038795 + ... + 8939529038808.
It is an arithmetic number, because the mean of its divisors is an integer number (35758116155208).
Almost surely, 2125153406543221 is an apocalyptic number.
It is an amenable number.
125153406543221 is a deficient number, since it is larger than the sum of its proper divisors (17879058077611).
125153406543221 is an equidigital number, since it uses as much as digits as its factorization.
125153406543221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17879058077610.
The product of its (nonzero) digits is 864000, while the sum is 44.
The spelling of 125153406543221 in words is "one hundred twenty-five trillion, one hundred fifty-three billion, four hundred six million, five hundred forty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •