Base | Representation |
---|---|
bin | 1000001110000001101… |
… | …0111011111110001010 |
3 | 111111110202110001211212 |
4 | 2003200122323332022 |
5 | 4303141223024432 |
6 | 144511314053122 |
7 | 13126112066465 |
oct | 2034032737612 |
9 | 444422401755 |
10 | 141204111242 |
11 | 549800487a7 |
12 | 23448b7a1a2 |
13 | 1041419585c |
14 | 6b9750c2dc |
15 | 3a167c02b2 |
hex | 20e06bbf8a |
141204111242 has 8 divisors (see below), whose sum is σ = 215802509796. Its totient is φ = 69269941312.
The previous prime is 141204111241. The next prime is 141204111277. The reversal of 141204111242 is 242111402141.
141204111242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 140610750361 + 593360881 = 374981^2 + 24359^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1412041112422 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141204111241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 666057023 + ... + 666057234.
Almost surely, 2141204111242 is an apocalyptic number.
141204111242 is a deficient number, since it is larger than the sum of its proper divisors (74598398554).
141204111242 is a wasteful number, since it uses less digits than its factorization.
141204111242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332114312.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 141204111242 its reverse (242111402141), we get a palindrome (383315513383).
The spelling of 141204111242 in words is "one hundred forty-one billion, two hundred four million, one hundred eleven thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •