Base | Representation |
---|---|
bin | 10000000111110… |
… | …01100101010111 |
3 | 100102110220102202 |
4 | 20003321211113 |
5 | 234110140043 |
6 | 21230355115 |
7 | 3231343532 |
oct | 1003714527 |
9 | 312426382 |
10 | 135240023 |
11 | 6a380916 |
12 | 3935ba9b |
13 | 220318a9 |
14 | 13d65a19 |
15 | bd161b8 |
hex | 80f9957 |
135240023 has 8 divisors (see below), whose sum is σ = 141345888. Its totient is φ = 129153024.
The previous prime is 135240013. The next prime is 135240029. The reversal of 135240023 is 320042531.
It is a happy number.
135240023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135240023 - 212 = 135235927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135239977 and 135240004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135240029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11111 + ... + 19847.
It is an arithmetic number, because the mean of its divisors is an integer number (17668236).
Almost surely, 2135240023 is an apocalyptic number.
135240023 is a deficient number, since it is larger than the sum of its proper divisors (6105865).
135240023 is an equidigital number, since it uses as much as digits as its factorization.
135240023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9433.
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 135240023 is about 11629.2743969691. The cubic root of 135240023 is about 513.2966288574.
Adding to 135240023 its reverse (320042531), we get a palindrome (455282554).
The spelling of 135240023 in words is "one hundred thirty-five million, two hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •