Base | Representation |
---|---|
bin | 111110111010111110… |
… | …1100000011111101011 |
3 | 110220202221211212021110 |
4 | 1331311331200133223 |
5 | 4203212444404311 |
6 | 142024043441403 |
7 | 12522321632442 |
oct | 1756575403753 |
9 | 426687755243 |
10 | 135123044331 |
11 | 5233a488170 |
12 | 22230526263 |
13 | c985384c02 |
14 | 677ba39d59 |
15 | 37ac9c28a6 |
hex | 1f75f607eb |
135123044331 has 8 divisors (see below), whose sum is σ = 196542609984. Its totient is φ = 81892754120.
The previous prime is 135123044293. The next prime is 135123044347. The reversal of 135123044331 is 133440321531.
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 135123044331 - 217 = 135122913259 is a prime.
It is a super-2 number, since 2×1351230443312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (135123044431) 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, 2047318821 + ... + 2047318886.
It is an arithmetic number, because the mean of its divisors is an integer number (24567826248).
Almost surely, 2135123044331 is an apocalyptic number.
135123044331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135123044331 is a deficient number, since it is larger than the sum of its proper divisors (61419565653).
135123044331 is a wasteful number, since it uses less digits than its factorization.
135123044331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4094637721.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 135123044331 its reverse (133440321531), we get a palindrome (268563365862).
The spelling of 135123044331 in words is "one hundred thirty-five billion, one hundred twenty-three million, forty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •