Base | Representation |
---|---|
bin | 10100101101110000011… |
… | …111010100011000101101 |
3 | 12001002100122201101211222 |
4 | 110231300133110120231 |
5 | 141310332441330013 |
6 | 3005542352353125 |
7 | 204563121351602 |
oct | 24556037243055 |
9 | 5032318641758 |
10 | 1423521433133 |
11 | 4a9791813128 |
12 | 1aba7a5457a5 |
13 | a4311a13947 |
14 | 4cc8246c6a9 |
15 | 2706811d508 |
hex | 14b707d462d |
1423521433133 has 2 divisors, whose sum is σ = 1423521433134. Its totient is φ = 1423521433132.
The previous prime is 1423521433123. The next prime is 1423521433141. The reversal of 1423521433133 is 3313341253241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 961994140969 + 461527292164 = 980813^2 + 679358^2 .
It is a cyclic number.
It is not a de Polignac number, because 1423521433133 - 28 = 1423521432877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1423521433093 and 1423521433102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1423521433123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711760716566 + 711760716567.
It is an arithmetic number, because the mean of its divisors is an integer number (711760716567).
Almost surely, 21423521433133 is an apocalyptic number.
It is an amenable number.
1423521433133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1423521433133 is an equidigital number, since it uses as much as digits as its factorization.
1423521433133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 77760, while the sum is 35.
Adding to 1423521433133 its reverse (3313341253241), we get a palindrome (4736862686374).
The spelling of 1423521433133 in words is "one trillion, four hundred twenty-three billion, five hundred twenty-one million, four hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •