Base | Representation |
---|---|
bin | 1000001101100000110… |
… | …0010010000111100000 |
3 | 111111010010122221020222 |
4 | 2003120030102013200 |
5 | 4302400402131224 |
6 | 144445503022212 |
7 | 13122514441550 |
oct | 2033014220740 |
9 | 444103587228 |
10 | 141066052064 |
11 | 5490a121903 |
12 | 2340a89a968 |
13 | 103c16b7a32 |
14 | 6b83051160 |
15 | 3a095edb5e |
hex | 20d83121e0 |
141066052064 has 48 divisors (see below), whose sum is σ = 334103817600. Its totient is φ = 57274936704.
The previous prime is 141066052051. The next prime is 141066052081. The reversal of 141066052064 is 460250660141.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16568354 + ... + 16576865.
It is an arithmetic number, because the mean of its divisors is an integer number (6960496200).
Almost surely, 2141066052064 is an apocalyptic number.
141066052064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
141066052064 is an abundant number, since it is smaller than the sum of its proper divisors (193037765536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141066052064 is a wasteful number, since it uses less digits than its factorization.
141066052064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33145255 (or 33145247 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 141066052064 in words is "one hundred forty-one billion, sixty-six million, fifty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •