Base | Representation |
---|---|
bin | 10000110100000… |
… | …01110101111110 |
3 | 100211101121220120 |
4 | 20122001311332 |
5 | 242101303042 |
6 | 21554555410 |
7 | 3331554213 |
oct | 1032016576 |
9 | 324347816 |
10 | 141041022 |
11 | 72683231 |
12 | 3b298b66 |
13 | 232b3135 |
14 | 14a35b0a |
15 | c5aedec |
hex | 8681d7e |
141041022 has 8 divisors (see below), whose sum is σ = 282082056. Its totient is φ = 47013672.
The previous prime is 141040981. The next prime is 141041023. The reversal of 141041022 is 220140141.
141041022 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.
141041022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 141040992 and 141041010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141041023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11753413 + ... + 11753424.
It is an arithmetic number, because the mean of its divisors is an integer number (35260257).
Almost surely, 2141041022 is an apocalyptic number.
141041022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141041022 is a wasteful number, since it uses less digits than its factorization.
141041022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23506842.
The product of its (nonzero) digits is 64, while the sum is 15.
The square root of 141041022 is about 11876.0692992252. The cubic root of 141041022 is about 520.5332572013.
Adding to 141041022 its reverse (220140141), we get a palindrome (361181163).
The spelling of 141041022 in words is "one hundred forty-one million, forty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •