Base | Representation |
---|---|
bin | 1000000110011011110… |
… | …1010001000101111111 |
3 | 111022012201221001001021 |
4 | 2001212331101011333 |
5 | 4240003032242203 |
6 | 143533200325011 |
7 | 13024445643535 |
oct | 2014675210577 |
9 | 438181831037 |
10 | 139166290303 |
11 | 54024819767 |
12 | 22b7a613767 |
13 | 1017ac38751 |
14 | 6a42a0a155 |
15 | 394793b5bd |
hex | 2066f5117f |
139166290303 has 4 divisors (see below), whose sum is σ = 139167415008. Its totient is φ = 139165165600.
The previous prime is 139166290199. The next prime is 139166290309. The reversal of 139166290303 is 303092661931.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 303092661931 = 1223 ⋅247827197.
It is a cyclic number.
It is not a de Polignac number, because 139166290303 - 213 = 139166282111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 139166290303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139166290309) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350026 + ... + 633127.
It is an arithmetic number, because the mean of its divisors is an integer number (34791853752).
Almost surely, 2139166290303 is an apocalyptic number.
139166290303 is a deficient number, since it is larger than the sum of its proper divisors (1124705).
139166290303 is an equidigital number, since it uses as much as digits as its factorization.
139166290303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1124704.
The product of its (nonzero) digits is 157464, while the sum is 43.
The spelling of 139166290303 in words is "one hundred thirty-nine billion, one hundred sixty-six million, two hundred ninety thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •