Base | Representation |
---|---|
bin | 1000010011010001000… |
… | …1111100100000110001 |
3 | 111122002210211110200200 |
4 | 2010310101330200301 |
5 | 4314031411242210 |
6 | 145303053305413 |
7 | 13206014561466 |
oct | 2046421744061 |
9 | 448083743620 |
10 | 142611040305 |
11 | 5553223a398 |
12 | 23780195269 |
13 | 105a97cc166 |
14 | 6c8c30566d |
15 | 3a9a0830c0 |
hex | 213447c831 |
142611040305 has 12 divisors (see below), whose sum is σ = 247192469940. Its totient is φ = 76059221472.
The previous prime is 142611040289. The next prime is 142611040331. The reversal of 142611040305 is 503040116241.
It is a happy number.
142611040305 is a `hidden beast` number, since 1 + 4 + 2 + 611 + 0 + 40 + 3 + 0 + 5 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 15350466609 + 127260573696 = 123897^2 + 356736^2 .
It is not a de Polignac number, because 142611040305 - 24 = 142611040289 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1584567070 + ... + 1584567159.
It is an arithmetic number, because the mean of its divisors is an integer number (20599372495).
Almost surely, 2142611040305 is an apocalyptic number.
142611040305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142611040305 is a deficient number, since it is larger than the sum of its proper divisors (104581429635).
142611040305 is a wasteful number, since it uses less digits than its factorization.
142611040305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3169134240 (or 3169134237 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 142611040305 its reverse (503040116241), we get a palindrome (645651156546).
The spelling of 142611040305 in words is "one hundred forty-two billion, six hundred eleven million, forty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •