Base | Representation |
---|---|
bin | 10010001111010101111… |
… | …001111101001110010001 |
3 | 11102211022021210211122212 |
4 | 102033111321331032101 |
5 | 131014003100114441 |
6 | 2355452023041505 |
7 | 156362010051410 |
oct | 22172571751621 |
9 | 4384267724585 |
10 | 1253424223121 |
11 | 44363532a704 |
12 | 182b092a0295 |
13 | 912748b1c55 |
14 | 4494792d477 |
15 | 2290eebeeeb |
hex | 123d5e7d391 |
1253424223121 has 8 divisors (see below), whose sum is σ = 1432493156160. Its totient is φ = 1074357372528.
The previous prime is 1253424223081. The next prime is 1253424223193. The reversal of 1253424223121 is 1213224243521.
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 1253424223121 - 210 = 1253424222097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1253424223421) 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, 1109435 + ... + 1933311.
It is an arithmetic number, because the mean of its divisors is an integer number (179061644520).
Almost surely, 21253424223121 is an apocalyptic number.
It is an amenable number.
1253424223121 is a deficient number, since it is larger than the sum of its proper divisors (179068933039).
1253424223121 is an equidigital number, since it uses as much as digits as its factorization.
1253424223121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041223.
The product of its digits is 23040, while the sum is 32.
Adding to 1253424223121 its reverse (1213224243521), we get a palindrome (2466648466642).
The spelling of 1253424223121 in words is "one trillion, two hundred fifty-three billion, four hundred twenty-four million, two hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •