Base | Representation |
---|---|
bin | 1000001101101011100… |
… | …0001000111101100010 |
3 | 111111020021102202222101 |
4 | 2003122320020331202 |
5 | 4302443420301310 |
6 | 144454152401014 |
7 | 13123602405421 |
oct | 2033270107542 |
9 | 444207382871 |
10 | 141111103330 |
11 | 549325a255a |
12 | 234219a616a |
13 | 103cab2c7a2 |
14 | 6b8901b2b8 |
15 | 3a0d54c43a |
hex | 20dae08f62 |
141111103330 has 8 divisors (see below), whose sum is σ = 253999986012. Its totient is φ = 56444441328.
The previous prime is 141111103313. The next prime is 141111103339. The reversal of 141111103330 is 33301111141.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 121544968689 + 19566134641 = 348633^2 + 139879^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 141111103298 and 141111103307.
It is not an unprimeable number, because it can be changed into a prime (141111103339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7055555157 + ... + 7055555176.
Almost surely, 2141111103330 is an apocalyptic number.
141111103330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141111103330 is a deficient number, since it is larger than the sum of its proper divisors (112888882682).
141111103330 is a wasteful number, since it uses less digits than its factorization.
141111103330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14111110340.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 141111103330 its reverse (33301111141), we get a palindrome (174412214471).
The spelling of 141111103330 in words is "one hundred forty-one billion, one hundred eleven million, one hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •