Base | Representation |
---|---|
bin | 111110111000100100… |
… | …1100100110000011001 |
3 | 110220120022221201021111 |
4 | 1331301021210300121 |
5 | 4203031313241213 |
6 | 142012041340321 |
7 | 12520321535635 |
oct | 1756111446031 |
9 | 426508851244 |
10 | 135042321433 |
11 | 522a8962928 |
12 | 222094976a1 |
13 | c971730796 |
14 | 6771025dc5 |
15 | 37a5879a3d |
hex | 1f71264c19 |
135042321433 has 2 divisors, whose sum is σ = 135042321434. Its totient is φ = 135042321432.
The previous prime is 135042321391. The next prime is 135042321481. The reversal of 135042321433 is 334123240531.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96813077904 + 38229243529 = 311148^2 + 195523^2 .
It is an emirp because it is prime and its reverse (334123240531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135042321433 - 29 = 135042320921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135042321395 and 135042321404.
It is not a weakly prime, because it can be changed into another prime (135042621433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67521160716 + 67521160717.
It is an arithmetic number, because the mean of its divisors is an integer number (67521160717).
Almost surely, 2135042321433 is an apocalyptic number.
It is an amenable number.
135042321433 is a deficient number, since it is larger than the sum of its proper divisors (1).
135042321433 is an equidigital number, since it uses as much as digits as its factorization.
135042321433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 135042321433 its reverse (334123240531), we get a palindrome (469165561964).
The spelling of 135042321433 in words is "one hundred thirty-five billion, forty-two million, three hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •