Base | Representation |
---|---|
bin | 1000001101111000101… |
… | …0011110001001000011 |
3 | 111111101010012000201020 |
4 | 2003132022132021003 |
5 | 4303102024142243 |
6 | 144503442240523 |
7 | 13125142146603 |
oct | 2033612361103 |
9 | 444333160636 |
10 | 141166240323 |
11 | 54960731819 |
12 | 23438356143 |
13 | 10409396124 |
14 | 6b92490c03 |
15 | 3a132de283 |
hex | 20de29e243 |
141166240323 has 4 divisors (see below), whose sum is σ = 188221653768. Its totient is φ = 94110826880.
The previous prime is 141166240231. The next prime is 141166240349. The reversal of 141166240323 is 323042661141.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323042661141 = 3 ⋅107680887047.
It is a cyclic number.
It is not a de Polignac number, because 141166240323 - 220 = 141165191747 is a prime.
It is a super-2 number, since 2×1411662403232 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141166241323) 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, 23527706718 + ... + 23527706723.
It is an arithmetic number, because the mean of its divisors is an integer number (47055413442).
Almost surely, 2141166240323 is an apocalyptic number.
141166240323 is a deficient number, since it is larger than the sum of its proper divisors (47055413445).
141166240323 is an equidigital number, since it uses as much as digits as its factorization.
141166240323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47055413444.
The product of its (nonzero) digits is 20736, while the sum is 33.
The spelling of 141166240323 in words is "one hundred forty-one billion, one hundred sixty-six million, two hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •