Base | Representation |
---|---|
bin | 1000001101011111110… |
… | …0110111110011000100 |
3 | 111111002212001200110200 |
4 | 2003113330313303010 |
5 | 4302343333341400 |
6 | 144445240250500 |
7 | 13122435214332 |
oct | 2032774676304 |
9 | 444085050420 |
10 | 141062012100 |
11 | 54907912599 |
12 | 23409470a30 |
13 | 103c0901c19 |
14 | 6b826bcb52 |
15 | 3a090a1b00 |
hex | 20d7f37cc4 |
141062012100 has 216 divisors, whose sum is σ = 446965559040. Its totient is φ = 37208160000.
The previous prime is 141062012053. The next prime is 141062012137. The reversal of 141062012100 is 1210260141.
141062012100 is a `hidden beast` number, since 1 + 41 + 0 + 620 + 1 + 2 + 1 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 97216375 + ... + 97217825.
Almost surely, 2141062012100 is an apocalyptic number.
141062012100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141062012100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223482779520).
141062012100 is an abundant number, since it is smaller than the sum of its proper divisors (305903546940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141062012100 is a wasteful number, since it uses less digits than its factorization.
141062012100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2571 (or 2561 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 141062012100 its reverse (1210260141), we get a palindrome (142272272241).
The spelling of 141062012100 in words is "one hundred forty-one billion, sixty-two million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •