Base | Representation |
---|---|
bin | 10000000101111… |
… | …11001110111111 |
3 | 100102000202120220 |
4 | 20002333032333 |
5 | 234030013043 |
6 | 21221312423 |
7 | 3226326663 |
oct | 1002771677 |
9 | 312022526 |
10 | 135001023 |
11 | 6a2282a3 |
12 | 39265713 |
13 | 21c79b81 |
14 | 13d028a3 |
15 | bcba483 |
hex | 80bf3bf |
135001023 has 8 divisors (see below), whose sum is σ = 189475200. Its totient is φ = 85263768.
The previous prime is 135001021. The next prime is 135001081. The reversal of 135001023 is 320100531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135001023 - 21 = 135001021 is a prime.
It is a super-2 number, since 2×1350010232 = 36450552422093058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 135000993 and 135001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135001021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1184163 + ... + 1184276.
It is an arithmetic number, because the mean of its divisors is an integer number (23684400).
Almost surely, 2135001023 is an apocalyptic number.
135001023 is a deficient number, since it is larger than the sum of its proper divisors (54474177).
135001023 is a wasteful number, since it uses less digits than its factorization.
135001023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2368461.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 135001023 is about 11618.9940614496. The cubic root of 135001023 is about 512.9940797815.
Adding to 135001023 its reverse (320100531), we get a palindrome (455101554).
The spelling of 135001023 in words is "one hundred thirty-five million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •