Base | Representation |
---|---|
bin | 1000001101010100011… |
… | …0001011101000111100 |
3 | 111110222111221120020222 |
4 | 2003111012023220330 |
5 | 4302244103333040 |
6 | 144440410000512 |
7 | 13121314152233 |
oct | 2032506135074 |
9 | 443874846228 |
10 | 141014121020 |
11 | 54892882293 |
12 | 233b5416138 |
13 | 103b3a046c6 |
14 | 6b7a1b3b1a |
15 | 3a04c91bb5 |
hex | 20d518ba3c |
141014121020 has 48 divisors (see below), whose sum is σ = 317356377408. Its totient is φ = 52495027200.
The previous prime is 141014121011. The next prime is 141014121047. The reversal of 141014121020 is 20121410141.
It is a self number, because there is not a number n which added to its sum of digits gives 141014121020.
It is a congruent number.
It is an unprimeable number.
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, 4125581 + ... + 4159620.
It is an arithmetic number, because the mean of its divisors is an integer number (6611591196).
Almost surely, 2141014121020 is an apocalyptic number.
141014121020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141014121020 is an abundant number, since it is smaller than the sum of its proper divisors (176342256388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141014121020 is a wasteful number, since it uses less digits than its factorization.
141014121020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8285270 (or 8285268 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 141014121020 its reverse (20121410141), we get a palindrome (161135531161).
The spelling of 141014121020 in words is "one hundred forty-one billion, fourteen million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •