Base | Representation |
---|---|
bin | 100000001000110101001111… |
… | …011110110011101011010000 |
3 | 200112110101122010000112110112 |
4 | 200020311033132303223100 |
5 | 122011241324012020422 |
6 | 1220340420534420452 |
7 | 41525540204433653 |
oct | 4010651736635320 |
9 | 615411563015415 |
10 | 141344412220112 |
11 | 41044912947782 |
12 | 13a295b1801728 |
13 | 60b394aa0b60a |
14 | 26c916b01d89a |
15 | 1151a5c447ee2 |
hex | 808d4f7b3ad0 |
141344412220112 has 20 divisors (see below), whose sum is σ = 273894140193636. Its totient is φ = 70662053460480.
The previous prime is 141344412220061. The next prime is 141344412220147. The reversal of 141344412220112 is 211022214443141.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 94607992568896 + 46736419651216 = 9726664^2 + 6836404^2 .
It is a super-3 number, since 3×1413444122201123 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 634425743 + ... + 634648494.
Almost surely, 2141344412220112 is an apocalyptic number.
It is an amenable number.
141344412220112 is a deficient number, since it is larger than the sum of its proper divisors (132549727973524).
141344412220112 is a wasteful number, since it uses less digits than its factorization.
141344412220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1269081206 (or 1269081200 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 141344412220112 its reverse (211022214443141), we get a palindrome (352366626663253).
The spelling of 141344412220112 in words is "one hundred forty-one trillion, three hundred forty-four billion, four hundred twelve million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •