Base | Representation |
---|---|
bin | 111111000000101011… |
… | …0011010000100111101 |
3 | 110221021021101120012220 |
4 | 1332001112122010331 |
5 | 4204110403333041 |
6 | 142055031115553 |
7 | 12530132023362 |
oct | 1760126320475 |
9 | 427237346186 |
10 | 135314121021 |
11 | 52428325992 |
12 | 22284512bb9 |
13 | c9b5b36741 |
14 | 6799178469 |
15 | 37be667d66 |
hex | 1f8159a13d |
135314121021 has 16 divisors (see below), whose sum is σ = 180994920768. Its totient is φ = 89921462400.
The previous prime is 135314121013. The next prime is 135314121031. The reversal of 135314121021 is 120121413531.
It is not a de Polignac number, because 135314121021 - 23 = 135314121013 is a prime.
It is a super-2 number, since 2×1353141210212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 135314120982 and 135314121000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135314121031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11231761 + ... + 11243801.
It is an arithmetic number, because the mean of its divisors is an integer number (11312182548).
Almost surely, 2135314121021 is an apocalyptic number.
It is an amenable number.
135314121021 is a deficient number, since it is larger than the sum of its proper divisors (45680799747).
135314121021 is a wasteful number, since it uses less digits than its factorization.
135314121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23692.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 135314121021 its reverse (120121413531), we get a palindrome (255435534552).
The spelling of 135314121021 in words is "one hundred thirty-five billion, three hundred fourteen million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •