Base | Representation |
---|---|
bin | 10000000110001… |
… | …01011111011110 |
3 | 100102002001202012 |
4 | 20003011133132 |
5 | 234031323104 |
6 | 21222031222 |
7 | 3226464500 |
oct | 1003053736 |
9 | 312061665 |
10 | 135026654 |
11 | 6a245584 |
12 | 39278512 |
13 | 21c88739 |
14 | 13d0bd70 |
15 | bcc2d6e |
hex | 80c57de |
135026654 has 48 divisors (see below), whose sum is σ = 250398720. Its totient is φ = 54295920.
The previous prime is 135026651. The next prime is 135026657. The reversal of 135026654 is 456620531.
135026654 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (135026651) and next prime (135026657).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 135026654.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135026651) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 236189 + ... + 236759.
It is an arithmetic number, because the mean of its divisors is an integer number (5216640).
Almost surely, 2135026654 is an apocalyptic number.
135026654 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
135026654 is a deficient number, since it is larger than the sum of its proper divisors (115372066).
135026654 is a wasteful number, since it uses less digits than its factorization.
135026654 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 733 (or 726 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
The square root of 135026654 is about 11620.0969875470. The cubic root of 135026654 is about 513.0265430398.
The spelling of 135026654 in words is "one hundred thirty-five million, twenty-six thousand, six hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •