Base | Representation |
---|---|
bin | 10000110100101… |
… | …10101100001000 |
3 | 100211112222001000 |
4 | 20122112230020 |
5 | 242112021113 |
6 | 22000455000 |
7 | 3332361153 |
oct | 1032265410 |
9 | 324488030 |
10 | 141126408 |
11 | 727313a5 |
12 | 3b31a460 |
13 | 23312c67 |
14 | 14a58c9a |
15 | c5ca373 |
hex | 8696b08 |
141126408 has 32 divisors (see below), whose sum is σ = 392018400. Its totient is φ = 47042064.
The previous prime is 141126389. The next prime is 141126421. The reversal of 141126408 is 804621141.
It is a happy number.
141126408 is a `hidden beast` number, since 1 + 4 + 1 + 12 + 640 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 326466 + ... + 326897.
It is an arithmetic number, because the mean of its divisors is an integer number (12250575).
Almost surely, 2141126408 is an apocalyptic number.
141126408 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
141126408 is an abundant number, since it is smaller than the sum of its proper divisors (250891992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141126408 is a wasteful number, since it uses less digits than its factorization.
141126408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 653378 (or 653368 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 141126408 is about 11879.6636316017. The cubic root of 141126408 is about 520.6382793333.
Adding to 141126408 its reverse (804621141), we get a palindrome (945747549).
The spelling of 141126408 in words is "one hundred forty-one million, one hundred twenty-six thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •