Base | Representation |
---|---|
bin | 100000000111001101110000… |
… | …101011110000100000100011 |
3 | 200112001202211111222200112120 |
4 | 200013031300223300200203 |
5 | 122002431244312112233 |
6 | 1220213403220355323 |
7 | 41514524560215006 |
oct | 4007156053604043 |
9 | 615052744880476 |
10 | 141233300113443 |
11 | 41001784a7344a |
12 | 13a0bb62545b43 |
13 | 60a6320cb2335 |
14 | 26c3a2a26953d |
15 | 114dc078c74b3 |
hex | 807370af0823 |
141233300113443 has 8 divisors (see below), whose sum is σ = 188311341910800. Its totient is φ = 94155395862528.
The previous prime is 141233300113439. The next prime is 141233300113457. The reversal of 141233300113443 is 344311003332141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141233300113443 - 22 = 141233300113439 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141233300113403) 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 7 ways as a sum of consecutive naturals, for example, 31966398 + ... + 36115331.
It is an arithmetic number, because the mean of its divisors is an integer number (23538917738850).
Almost surely, 2141233300113443 is an apocalyptic number.
141233300113443 is a deficient number, since it is larger than the sum of its proper divisors (47078041797357).
141233300113443 is an equidigital number, since it uses as much as digits as its factorization.
141233300113443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68773221.
The product of its (nonzero) digits is 31104, while the sum is 33.
Adding to 141233300113443 its reverse (344311003332141), we get a palindrome (485544303445584).
The spelling of 141233300113443 in words is "one hundred forty-one trillion, two hundred thirty-three billion, three hundred million, one hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •