Base | Representation |
---|---|
bin | 100000000101010101010111… |
… | …100101111101001101010011 |
3 | 200111121102011110201210122011 |
4 | 200011111113211331031103 |
5 | 121443322023204041230 |
6 | 1220034144020323351 |
7 | 41502300256463431 |
oct | 4005252745751523 |
9 | 614542143653564 |
10 | 141104030143315 |
11 | 40a61979494598 |
12 | 139aaaa6243557 |
13 | 609708c432655 |
14 | 26bb685b13d51 |
15 | 114a68dbb8e2a |
hex | 80555797d353 |
141104030143315 has 4 divisors (see below), whose sum is σ = 169324836171984. Its totient is φ = 112883224114648.
The previous prime is 141104030143231. The next prime is 141104030143411. The reversal of 141104030143315 is 513341030401141.
141104030143315 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141104030143315 - 217 = 141104030012243 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14110403014327 + ... + 14110403014336.
It is an arithmetic number, because the mean of its divisors is an integer number (42331209042996).
Almost surely, 2141104030143315 is an apocalyptic number.
141104030143315 is a deficient number, since it is larger than the sum of its proper divisors (28220806028669).
141104030143315 is an equidigital number, since it uses as much as digits as its factorization.
141104030143315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28220806028668.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 141104030143315 its reverse (513341030401141), we get a palindrome (654445060544456).
The spelling of 141104030143315 in words is "one hundred forty-one trillion, one hundred four billion, thirty million, one hundred forty-three thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •