Base | Representation |
---|---|
bin | 1000001111000100100… |
… | …0011110011000101101 |
3 | 111112012022000111011022 |
4 | 2003301020132120231 |
5 | 4304230011443031 |
6 | 144555211303525 |
7 | 13136055162260 |
oct | 2036110363055 |
9 | 445168014138 |
10 | 141484484141 |
11 | 55004337040 |
12 | 23506a4aba5 |
13 | 1045a2b0b90 |
14 | 6bc2852cd7 |
15 | 3a3120397b |
hex | 20f121e62d |
141484484141 has 16 divisors (see below), whose sum is σ = 189965182848. Its totient is φ = 101767060800.
The previous prime is 141484484129. The next prime is 141484484171.
141484484141 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141484484141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141484484092 and 141484484101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141484484171) 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 15 ways as a sum of consecutive naturals, for example, 70670570 + ... + 70672571.
It is an arithmetic number, because the mean of its divisors is an integer number (11872823928).
Almost surely, 2141484484141 is an apocalyptic number.
141484484141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
141484484141 is a deficient number, since it is larger than the sum of its proper divisors (48480698707).
141484484141 is a wasteful number, since it uses less digits than its factorization.
141484484141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141343172.
The product of its digits is 262144, while the sum is 44.
The spelling of 141484484141 in words is "one hundred forty-one billion, four hundred eighty-four million, four hundred eighty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •