Base | Representation |
---|---|
bin | 111110111000001101… |
… | …0100111010101011111 |
3 | 110220112110210021212002 |
4 | 1331300122213111133 |
5 | 4203020140324411 |
6 | 142010521432515 |
7 | 12520112105063 |
oct | 1756032472537 |
9 | 426473707762 |
10 | 135030011231 |
11 | 522a1a15005 |
12 | 2220533b73b |
13 | c96c01053b |
14 | 676d53daa3 |
15 | 37a474733b |
hex | 1f706a755f |
135030011231 has 8 divisors (see below), whose sum is σ = 138976446960. Its totient is φ = 131099205888.
The previous prime is 135030011209. The next prime is 135030011257. The reversal of 135030011231 is 132110030531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135030011231 is a prime.
It is a super-2 number, since 2×1350300112312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135030013231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3890066 + ... + 3924623.
It is an arithmetic number, because the mean of its divisors is an integer number (17372055870).
Almost surely, 2135030011231 is an apocalyptic number.
135030011231 is a deficient number, since it is larger than the sum of its proper divisors (3946435729).
135030011231 is an equidigital number, since it uses as much as digits as its factorization.
135030011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7815193.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 135030011231 its reverse (132110030531), we get a palindrome (267140041762).
The spelling of 135030011231 in words is "one hundred thirty-five billion, thirty million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •