Base | Representation |
---|---|
bin | 100000000100011001110011… |
… | …011011011101100001000000 |
3 | 200111101022002011102020100010 |
4 | 200010121303123131201000 |
5 | 121441300032044112142 |
6 | 1215544525341224520 |
7 | 41464544323636005 |
oct | 4004316333354100 |
9 | 614338064366303 |
10 | 141040072644672 |
11 | 40a378391121a3 |
12 | 1399a616b62140 |
13 | 6091038b14cb6 |
14 | 26b85398118ac |
15 | 1148b98cd8e9c |
hex | 8046736dd840 |
141040072644672 has 28 divisors (see below), whose sum is σ = 373168525539536. Its totient is φ = 47013357548160.
The previous prime is 141040072644557. The next prime is 141040072644683. The reversal of 141040072644672 is 276446270040141.
It is a super-2 number, since 2×1410400726446722 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 367291855654 + ... + 367291856037.
Almost surely, 2141040072644672 is an apocalyptic number.
141040072644672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
141040072644672 is an abundant number, since it is smaller than the sum of its proper divisors (232128452894864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141040072644672 is an equidigital number, since it uses as much as digits as its factorization.
141040072644672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 734583711706 (or 734583711696 counting only the distinct ones).
The product of its (nonzero) digits is 1806336, while the sum is 48.
The spelling of 141040072644672 in words is "one hundred forty-one trillion, forty billion, seventy-two million, six hundred forty-four thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •