Base | Representation |
---|---|
bin | 10100101101110000101… |
… | …111010111101110100001 |
3 | 12001002100221122012010101 |
4 | 110231300233113232201 |
5 | 141310340031003441 |
6 | 3005543022502401 |
7 | 204563202206023 |
oct | 24556057275641 |
9 | 5032327565111 |
10 | 1423525641121 |
11 | 4a9794127701 |
12 | 1aba7ba34a01 |
13 | a431285808c |
14 | 4cc82c46013 |
15 | 270686a0231 |
hex | 14b70bd7ba1 |
1423525641121 has 2 divisors, whose sum is σ = 1423525641122. Its totient is φ = 1423525641120.
The previous prime is 1423525641119. The next prime is 1423525641169. The reversal of 1423525641121 is 1211465253241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1422724128400 + 801512721 = 1192780^2 + 28311^2 .
It is a cyclic number.
It is not a de Polignac number, because 1423525641121 - 21 = 1423525641119 is a prime.
It is a super-2 number, since 2×14235256411212 (a number of 25 digits) contains 22 as substring.
Together with 1423525641119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1423525641221) 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 as a sum of consecutive naturals, namely, 711762820560 + 711762820561.
It is an arithmetic number, because the mean of its divisors is an integer number (711762820561).
Almost surely, 21423525641121 is an apocalyptic number.
It is an amenable number.
1423525641121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1423525641121 is an equidigital number, since it uses as much as digits as its factorization.
1423525641121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 57600, while the sum is 37.
The spelling of 1423525641121 in words is "one trillion, four hundred twenty-three billion, five hundred twenty-five million, six hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •