Base | Representation |
---|---|
bin | 1000001110101101000… |
… | …1110011111110100000 |
3 | 111111221110012121201210 |
4 | 2003223101303332200 |
5 | 4304024341043301 |
6 | 144541342230120 |
7 | 13133453311440 |
oct | 2035321637640 |
9 | 444843177653 |
10 | 141386268576 |
11 | 54a63954253 |
12 | 23499b85340 |
13 | 10442b43667 |
14 | 6bb37a8120 |
15 | 3a277a2ad6 |
hex | 20eb473fa0 |
141386268576 has 96 divisors (see below), whose sum is σ = 449109360000. Its totient is φ = 38019833856.
The previous prime is 141386268539. The next prime is 141386268601. The reversal of 141386268576 is 675862683141.
141386268576 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (96).
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 15 ways as a sum of consecutive naturals, for example, 6176701 + ... + 6199548.
It is an arithmetic number, because the mean of its divisors is an integer number (4678222500).
Almost surely, 2141386268576 is an apocalyptic number.
141386268576 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
141386268576 is an abundant number, since it is smaller than the sum of its proper divisors (307723091424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141386268576 is a wasteful number, since it uses less digits than its factorization.
141386268576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12376286 (or 12376278 counting only the distinct ones).
The product of its digits is 11612160, while the sum is 57.
The spelling of 141386268576 in words is "one hundred forty-one billion, three hundred eighty-six million, two hundred sixty-eight thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •