Base | Representation |
---|---|
bin | 100000000101100101010001… |
… | …000111101001000010000010 |
3 | 200111200001020012022121102022 |
4 | 200011211101013221002002 |
5 | 121444112003424332432 |
6 | 1220050050004521442 |
7 | 41503443310003553 |
oct | 4005452107510202 |
9 | 614601205277368 |
10 | 141121101402242 |
11 | 40a691397a4045 |
12 | 139b226b3b0282 |
13 | 60988801155b0 |
14 | 26bc42506232a |
15 | 114ad3c769b12 |
hex | 8059511e9082 |
141121101402242 has 8 divisors (see below), whose sum is σ = 227964856111356. Its totient is φ = 65132816031792.
The previous prime is 141121101402131. The next prime is 141121101402293. The reversal of 141121101402242 is 242204101121141.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 128124492385681 + 12996609016561 = 11319209^2 + 3605081^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 5427734669317 = 141121101402242 / (1 + 4 + 1 + 1 + 2 + 1 + 1 + 0 + 1 + 4 + 0 + 2 + 2 + 4 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2713867334633 + ... + 2713867334684.
Almost surely, 2141121101402242 is an apocalyptic number.
141121101402242 is a deficient number, since it is larger than the sum of its proper divisors (86843754709114).
141121101402242 is a wasteful number, since it uses less digits than its factorization.
141121101402242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5427734669332.
The product of its (nonzero) digits is 1024, while the sum is 26.
Adding to 141121101402242 its reverse (242204101121141), we get a palindrome (383325202523383).
The spelling of 141121101402242 in words is "one hundred forty-one trillion, one hundred twenty-one billion, one hundred one million, four hundred two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •