Base | Representation |
---|---|
bin | 1000010010010101010… |
… | …1111111000100001111 |
3 | 111121110100021201012202 |
4 | 2010211111333010033 |
5 | 4313023233103403 |
6 | 145222142152115 |
7 | 13166552532536 |
oct | 2044525770417 |
9 | 447410251182 |
10 | 142360441103 |
11 | 55413837511 |
12 | 2371028263b |
13 | 10569909aca |
14 | 6c66d1131d |
15 | 3a83081688 |
hex | 212557f10f |
142360441103 has 8 divisors (see below), whose sum is σ = 144898344960. Its totient is φ = 139829122080.
The previous prime is 142360441073. The next prime is 142360441123. The reversal of 142360441103 is 301144063241.
It is a happy number.
142360441103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 142360441103 - 214 = 142360424719 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 (142360441123) 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, 1602575 + ... + 1689072.
It is an arithmetic number, because the mean of its divisors is an integer number (18112293120).
Almost surely, 2142360441103 is an apocalyptic number.
142360441103 is a deficient number, since it is larger than the sum of its proper divisors (2537903857).
142360441103 is an equidigital number, since it uses as much as digits as its factorization.
142360441103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3292417.
The product of its (nonzero) digits is 6912, while the sum is 29.
The spelling of 142360441103 in words is "one hundred forty-two billion, three hundred sixty million, four hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •