Base | Representation |
---|---|
bin | 10000000111000… |
… | …11111010010110 |
3 | 100102022101200000 |
4 | 20003203322112 |
5 | 234044320004 |
6 | 21224432130 |
7 | 3230523660 |
oct | 1003437226 |
9 | 312271600 |
10 | 135151254 |
11 | 6a320157 |
12 | 39318646 |
13 | 22000374 |
14 | 13d41530 |
15 | bce9c39 |
hex | 80e3e96 |
135151254 has 48 divisors (see below), whose sum is σ = 347063808. Its totient is φ = 38613672.
The previous prime is 135151253. The next prime is 135151267. The reversal of 135151254 is 452151531.
It is a super-2 number, since 2×1351512542 = 36531722915545032, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135151253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16462 + ... + 23265.
It is an arithmetic number, because the mean of its divisors is an integer number (7230496).
Almost surely, 2135151254 is an apocalyptic number.
135151254 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
135151254 is an abundant number, since it is smaller than the sum of its proper divisors (211912554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135151254 is an equidigital number, since it uses as much as digits as its factorization.
135151254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39751 (or 39739 counting only the distinct ones).
The product of its digits is 3000, while the sum is 27.
The square root of 135151254 is about 11625.4571523016. The cubic root of 135151254 is about 513.1842982017.
The spelling of 135151254 in words is "one hundred thirty-five million, one hundred fifty-one thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •