Base | Representation |
---|---|
bin | 10101110111010000000… |
… | …011011000110001011101 |
3 | 12022122001012220000101122 |
4 | 111313100003120301131 |
5 | 144103441114311013 |
6 | 3110113025420325 |
7 | 213355501302311 |
oct | 25672003306135 |
9 | 5278035800348 |
10 | 1502434135133 |
11 | 52a1a69a0118 |
12 | 20322219a6a5 |
13 | ab8a97c4459 |
14 | 52a0aa53b41 |
15 | 29135e14a08 |
hex | 15dd00d8c5d |
1502434135133 has 2 divisors, whose sum is σ = 1502434135134. Its totient is φ = 1502434135132.
The previous prime is 1502434135087. The next prime is 1502434135151. The reversal of 1502434135133 is 3315314342051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 833894059684 + 668540075449 = 913178^2 + 817643^2 .
It is a cyclic number.
It is not a de Polignac number, because 1502434135133 - 240 = 402922507357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1502434135093 and 1502434135102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1502434138133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 751217067566 + 751217067567.
It is an arithmetic number, because the mean of its divisors is an integer number (751217067567).
Almost surely, 21502434135133 is an apocalyptic number.
It is an amenable number.
1502434135133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1502434135133 is an equidigital number, since it uses as much as digits as its factorization.
1502434135133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 1502434135133 its reverse (3315314342051), we get a palindrome (4817748477184).
The spelling of 1502434135133 in words is "one trillion, five hundred two billion, four hundred thirty-four million, one hundred thirty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •