Base | Representation |
---|---|
bin | 1000001110000101100… |
… | …0101100010101001110 |
3 | 111111111212220112210120 |
4 | 2003201120230111032 |
5 | 4303204344100420 |
6 | 144513053045410 |
7 | 13126366513401 |
oct | 2034130542516 |
9 | 444455815716 |
10 | 141220300110 |
11 | 549891a572a |
12 | 23452486866 |
13 | 10417643376 |
14 | 6b99723d38 |
15 | 3a17e1bd40 |
hex | 20e162c54e |
141220300110 has 32 divisors (see below), whose sum is σ = 339147073440. Its totient is φ = 37634485248.
The previous prime is 141220300099. The next prime is 141220300147. The reversal of 141220300110 is 11003022141.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 141220300110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1468975 + ... + 1562154.
It is an arithmetic number, because the mean of its divisors is an integer number (10598346045).
Almost surely, 2141220300110 is an apocalyptic number.
141220300110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141220300110 is an abundant number, since it is smaller than the sum of its proper divisors (197926773330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141220300110 is a wasteful number, since it uses less digits than its factorization.
141220300110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3032692.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 141220300110 its reverse (11003022141), we get a palindrome (152223322251).
It can be divided in two parts, 141220 and 300110, that added together give a triangular number (441330 = T939).
The spelling of 141220300110 in words is "one hundred forty-one billion, two hundred twenty million, three hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •