Base | Representation |
---|---|
bin | 10000000111110… |
… | …00111110011011 |
3 | 100102110210000110 |
4 | 20003320332123 |
5 | 234110100111 |
6 | 21230335403 |
7 | 3231333342 |
oct | 1003707633 |
9 | 312423013 |
10 | 135237531 |
11 | 6a379a60 |
12 | 3935a563 |
13 | 22030710 |
14 | 13d64b59 |
15 | bd155a6 |
hex | 80f8f9b |
135237531 has 32 divisors (see below), whose sum is σ = 218695680. Its totient is φ = 73209600.
The previous prime is 135237523. The next prime is 135237551. The reversal of 135237531 is 135732531.
It is not a de Polignac number, because 135237531 - 23 = 135237523 is a prime.
It is a super-2 number, since 2×1352375312 = 36578379581951922, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (135237511) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8215 + ... + 18383.
It is an arithmetic number, because the mean of its divisors is an integer number (6834240).
Almost surely, 2135237531 is an apocalyptic number.
135237531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135237531 is a deficient number, since it is larger than the sum of its proper divisors (83458149).
135237531 is a wasteful number, since it uses less digits than its factorization.
135237531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10227.
The product of its digits is 9450, while the sum is 30.
The square root of 135237531 is about 11629.1672530753. The cubic root of 135237531 is about 513.2934760850.
It can be divided in two parts, 1352 and 37531, that added together give a palindrome (38883).
The spelling of 135237531 in words is "one hundred thirty-five million, two hundred thirty-seven thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •