Base | Representation |
---|---|
bin | 1000001101010011011… |
… | …0111101100010011100 |
3 | 111110222020102212010011 |
4 | 2003110312331202130 |
5 | 4302242043143400 |
6 | 144440144253004 |
7 | 13121235223636 |
oct | 2032466754234 |
9 | 443866385104 |
10 | 141010131100 |
11 | 548905a7633 |
12 | 233b4011164 |
13 | 103b2c385c7 |
14 | 6b79855a56 |
15 | 3a047548ba |
hex | 20d4dbd89c |
141010131100 has 36 divisors (see below), whose sum is σ = 306145950544. Its totient is φ = 56375671680.
The previous prime is 141010131089. The next prime is 141010131103. The reversal of 141010131100 is 1131010141.
It is a happy number.
141010131100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141010131103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 154464 + ... + 553063.
Almost surely, 2141010131100 is an apocalyptic number.
141010131100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141010131100 is an abundant number, since it is smaller than the sum of its proper divisors (165135819444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141010131100 is a wasteful number, since it uses less digits than its factorization.
141010131100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709534 (or 709527 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 141010131100 its reverse (1131010141), we get a palindrome (142141141241).
The spelling of 141010131100 in words is "one hundred forty-one billion, ten million, one hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •