Base | Representation |
---|---|
bin | 100000001010000101001011… |
… | …111000001011111110100001 |
3 | 200112202121012101000222000211 |
4 | 200022011023320023332201 |
5 | 122014143123241012210 |
6 | 1220444054352014121 |
7 | 41534666316113023 |
oct | 4012051370137641 |
9 | 615677171028024 |
10 | 141430251110305 |
11 | 41078261744443 |
12 | 13a42168b31341 |
13 | 60bba7a720531 |
14 | 26cd39142a013 |
15 | 1153dd332838a |
hex | 80a14be0bfa1 |
141430251110305 has 4 divisors (see below), whose sum is σ = 169716301332372. Its totient is φ = 113144200888240.
The previous prime is 141430251110303. The next prime is 141430251110311. The reversal of 141430251110305 is 503011152034141.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18763373652241 + 122666877458064 = 4331671^2 + 11075508^2 .
It is not a de Polignac number, because 141430251110305 - 21 = 141430251110303 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141430251110303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14143025111026 + ... + 14143025111035.
It is an arithmetic number, because the mean of its divisors is an integer number (42429075333093).
Almost surely, 2141430251110305 is an apocalyptic number.
It is an amenable number.
141430251110305 is a deficient number, since it is larger than the sum of its proper divisors (28286050222067).
141430251110305 is an equidigital number, since it uses as much as digits as its factorization.
141430251110305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28286050222066.
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 141430251110305 in words is "one hundred forty-one trillion, four hundred thirty billion, two hundred fifty-one million, one hundred ten thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •