Base | Representation |
---|---|
bin | 111110111000100011… |
… | …0100001000110010111 |
3 | 110220120021102222221122 |
4 | 1331301012201012113 |
5 | 4203031112120043 |
6 | 142012012234155 |
7 | 12520311660314 |
oct | 1756106410627 |
9 | 426507388848 |
10 | 135041520023 |
11 | 522a8465803 |
12 | 2220916b95b |
13 | c97150ca87 |
14 | 6770c97d0b |
15 | 37a576c368 |
hex | 1f711a1197 |
135041520023 has 8 divisors (see below), whose sum is σ = 135225340800. Its totient is φ = 134857792440.
The previous prime is 135041520017. The next prime is 135041520041. The reversal of 135041520023 is 320025140531.
It is a happy number.
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 135041520023 - 230 = 133967778199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135041519974 and 135041520001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135041520073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3168968 + ... + 3211298.
It is an arithmetic number, because the mean of its divisors is an integer number (16903167600).
Almost surely, 2135041520023 is an apocalyptic number.
135041520023 is a deficient number, since it is larger than the sum of its proper divisors (183820777).
135041520023 is an equidigital number, since it uses as much as digits as its factorization.
135041520023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46597.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 135041520023 its reverse (320025140531), we get a palindrome (455066660554).
The spelling of 135041520023 in words is "one hundred thirty-five billion, forty-one million, five hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •