Base | Representation |
---|---|
bin | 10000110100100… |
… | …00011111111010 |
3 | 100211111200020211 |
4 | 20122100133322 |
5 | 242110213200 |
6 | 22000141334 |
7 | 3332224216 |
oct | 1032203772 |
9 | 324450224 |
10 | 141101050 |
11 | 72714342 |
12 | 3b30784a |
13 | 2330455c |
14 | 14a4d946 |
15 | c5c2aba |
hex | 86907fa |
141101050 has 48 divisors (see below), whose sum is σ = 271232640. Its totient is φ = 54581760.
The previous prime is 141101041. The next prime is 141101089. The reversal of 141101050 is 50101141.
141101050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1411010502 = 39819012622205000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 141101050.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 227641 + ... + 228259.
It is an arithmetic number, because the mean of its divisors is an integer number (5650680).
Almost surely, 2141101050 is an apocalyptic number.
141101050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141101050 is a deficient number, since it is larger than the sum of its proper divisors (130131590).
141101050 is a wasteful number, since it uses less digits than its factorization.
141101050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 775 (or 770 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 141101050 is about 11878.5962975429. The cubic root of 141101050 is about 520.6070942029.
Adding to 141101050 its reverse (50101141), we get a palindrome (191202191).
Subtracting from 141101050 its reverse (50101141), we obtain a palindrome (90999909).
The spelling of 141101050 in words is "one hundred forty-one million, one hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •