Base | Representation |
---|---|
bin | 11111110110110001010010… |
… | …110111010011000101000111 |
3 | 200101001201220112022202100011 |
4 | 133312301102313103011013 |
5 | 121330422400144021203 |
6 | 1213550310551131051 |
7 | 41340060324642130 |
oct | 3766612267230507 |
9 | 611051815282304 |
10 | 140103223423303 |
11 | 40706497158a48 |
12 | 13868b3a073a87 |
13 | 60238a5ca02ba |
14 | 26850644b2c87 |
15 | 112e6166ee76d |
hex | 7f6c52dd3147 |
140103223423303 has 8 divisors (see below), whose sum is σ = 160479409742208. Its totient is φ = 119817397133304.
The previous prime is 140103223423283. The next prime is 140103223423313. The reversal of 140103223423303 is 303324322301041.
It is a happy number.
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 140103223423303 - 221 = 140103221326151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140103223423313) 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, 22590003901 + ... + 22590010102.
It is an arithmetic number, because the mean of its divisors is an integer number (20059926217776).
Almost surely, 2140103223423303 is an apocalyptic number.
140103223423303 is a deficient number, since it is larger than the sum of its proper divisors (20376186318905).
140103223423303 is an equidigital number, since it uses as much as digits as its factorization.
140103223423303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45180014453.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 140103223423303 its reverse (303324322301041), we get a palindrome (443427545724344).
The spelling of 140103223423303 in words is "one hundred forty trillion, one hundred three billion, two hundred twenty-three million, four hundred twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •