Base | Representation |
---|---|
bin | 111110110111101101… |
… | …0101110110011110111 |
3 | 110220111022021110211122 |
4 | 1331233122232303313 |
5 | 4203001343432011 |
6 | 142005122454155 |
7 | 12516516546140 |
oct | 1755732566367 |
9 | 426438243748 |
10 | 135013264631 |
11 | 52293517043 |
12 | 221bb80435b |
13 | c9686c8bcb |
14 | 676b220ac7 |
15 | 37a303a3db |
hex | 1f6f6aecf7 |
135013264631 has 48 divisors (see below), whose sum is σ = 169876783872. Its totient is φ = 104743653120.
The previous prime is 135013264613. The next prime is 135013264649. The reversal of 135013264631 is 136462310531.
It is an interprime number because it is at equal distance from previous prime (135013264613) and next prime (135013264649).
It is not a de Polignac number, because 135013264631 - 222 = 135009070327 is a prime.
It is a super-2 number, since 2×1350132646312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135013264591 and 135013264600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135013264601) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18636896 + ... + 18644138.
It is an arithmetic number, because the mean of its divisors is an integer number (3539099664).
Almost surely, 2135013264631 is an apocalyptic number.
135013264631 is a deficient number, since it is larger than the sum of its proper divisors (34863519241).
135013264631 is a wasteful number, since it uses less digits than its factorization.
135013264631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7492 (or 7461 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 35.
The spelling of 135013264631 in words is "one hundred thirty-five billion, thirteen million, two hundred sixty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •