Base | Representation |
---|---|
bin | 1000001111000100001… |
… | …1001111000100000101 |
3 | 111112012012102201002200 |
4 | 2003301003033010011 |
5 | 4304224134020121 |
6 | 144555122025113 |
7 | 13136040412044 |
oct | 2036103170405 |
9 | 445165381080 |
10 | 141483110661 |
11 | 55003589132 |
12 | 235064a8199 |
13 | 10459c1c979 |
14 | 6bc25b655b |
15 | 3a31031a26 |
hex | 20f10cf105 |
141483110661 has 12 divisors (see below), whose sum is σ = 204395510592. Its totient is φ = 94307758056.
The previous prime is 141483110647. The next prime is 141483110687. The reversal of 141483110661 is 166011384141.
141483110661 is a `hidden beast` number, since 1 + 4 + 1 + 483 + 110 + 6 + 61 = 666.
It is not a de Polignac number, because 141483110661 - 215 = 141483077893 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141403110661) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1130211 + ... + 1249136.
It is an arithmetic number, because the mean of its divisors is an integer number (17032959216).
Almost surely, 2141483110661 is an apocalyptic number.
It is an amenable number.
141483110661 is a deficient number, since it is larger than the sum of its proper divisors (62912399931).
141483110661 is a wasteful number, since it uses less digits than its factorization.
141483110661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2385960 (or 2385957 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The spelling of 141483110661 in words is "one hundred forty-one billion, four hundred eighty-three million, one hundred ten thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •