Base | Representation |
---|---|
bin | 10110000111111111001… |
… | …110011100011101001101 |
3 | 12101100102200001111022112 |
4 | 112013333032130131031 |
5 | 144402242242312031 |
6 | 3122244204553405 |
7 | 214563030640241 |
oct | 26077716343515 |
9 | 5340380044275 |
10 | 1520405432141 |
11 | 5368892585a2 |
12 | 2067b8852865 |
13 | b04b1ab51cb |
14 | 5383372c421 |
15 | 298389ed62b |
hex | 161ff39c74d |
1520405432141 has 2 divisors, whose sum is σ = 1520405432142. Its totient is φ = 1520405432140.
The previous prime is 1520405432113. The next prime is 1520405432173. The reversal of 1520405432141 is 1412345040251.
It is an a-pointer prime, because the next prime (1520405432173) can be obtained adding 1520405432141 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 890279054116 + 630126378025 = 943546^2 + 793805^2 .
It is a cyclic number.
It is not a de Polignac number, because 1520405432141 - 222 = 1520401237837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1520405432098 and 1520405432107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1520405432111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 760202716070 + 760202716071.
It is an arithmetic number, because the mean of its divisors is an integer number (760202716071).
Almost surely, 21520405432141 is an apocalyptic number.
It is an amenable number.
1520405432141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1520405432141 is an equidigital number, since it uses as much as digits as its factorization.
1520405432141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19200, while the sum is 32.
The spelling of 1520405432141 in words is "one trillion, five hundred twenty billion, four hundred five million, four hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •