Base | Representation |
---|---|
bin | 100000001010010000010001… |
… | …001110111001100000100011 |
3 | 200112210201220202212101122120 |
4 | 200022100101032321200203 |
5 | 122014342011420010430 |
6 | 1220453343323435323 |
7 | 41535600246000333 |
oct | 4012202116714043 |
9 | 615721822771576 |
10 | 141442152110115 |
11 | 4108230952777a |
12 | 13a4452a685b43 |
13 | 60bcc2620165c |
14 | 26cdb9dc370c3 |
15 | 115437d040610 |
hex | 80a4113b9823 |
141442152110115 has 24 divisors (see below), whose sum is σ = 226333173965808. Its totient is φ = 75427238563200.
The previous prime is 141442152110113. The next prime is 141442152110141. The reversal of 141442152110115 is 511011251244141.
It is not a de Polignac number, because 141442152110115 - 21 = 141442152110113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141442152110113) 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 23 ways as a sum of consecutive naturals, for example, 1390713765 + ... + 1390815465.
It is an arithmetic number, because the mean of its divisors is an integer number (9430548915242).
Almost surely, 2141442152110115 is an apocalyptic number.
141442152110115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
141442152110115 is a deficient number, since it is larger than the sum of its proper divisors (84891021855693).
141442152110115 is an frugal number, since it uses more digits than its factorization.
141442152110115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120967 (or 111338 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 33.
The spelling of 141442152110115 in words is "one hundred forty-one trillion, four hundred forty-two billion, one hundred fifty-two million, one hundred ten thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •