Base | Representation |
---|---|
bin | 1000001110000001101… |
… | …0101010111000010001 |
3 | 111111110202022111210221 |
4 | 2003200122222320101 |
5 | 4303141213304413 |
6 | 144511312353041 |
7 | 13126111355413 |
oct | 2034032527021 |
9 | 444422274727 |
10 | 141204041233 |
11 | 54980000142 |
12 | 23448b45781 |
13 | 1041416ca28 |
14 | 6b974d09b3 |
15 | 3a167a968d |
hex | 20e06aae11 |
141204041233 has 8 divisors (see below), whose sum is σ = 143000801280. Its totient is φ = 139407515520.
The previous prime is 141204041137. The next prime is 141204041249. The reversal of 141204041233 is 332140402141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141204041233 - 29 = 141204040721 is a prime.
It is a super-3 number, since 3×1412040412333 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141204041198 and 141204041207.
It is not an unprimeable number, because it can be changed into a prime (141204042233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1376193 + ... + 1475233.
It is an arithmetic number, because the mean of its divisors is an integer number (17875100160).
Almost surely, 2141204041233 is an apocalyptic number.
It is an amenable number.
141204041233 is a deficient number, since it is larger than the sum of its proper divisors (1796760047).
141204041233 is an equidigital number, since it uses as much as digits as its factorization.
141204041233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117167.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 141204041233 its reverse (332140402141), we get a palindrome (473344443374).
The spelling of 141204041233 in words is "one hundred forty-one billion, two hundred four million, forty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.364 sec. • engine limits •