Base | Representation |
---|---|
bin | 1000001111110000001… |
… | …0100001001101111111 |
3 | 111112200001100020122212 |
4 | 2003330002201031333 |
5 | 4310113333103010 |
6 | 145025305331035 |
7 | 13143436434311 |
oct | 2037402411577 |
9 | 445601306585 |
10 | 141667472255 |
11 | 5509865a791 |
12 | 23558196a7b |
13 | 1048918cb7a |
14 | 6bdcc877b1 |
15 | 3a422ec505 |
hex | 20fc0a137f |
141667472255 has 4 divisors (see below), whose sum is σ = 170000966712. Its totient is φ = 113333977800.
The previous prime is 141667472249. The next prime is 141667472263. The reversal of 141667472255 is 552274766141.
It is a happy number.
141667472255 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 552274766141 = 7 ⋅78896395163.
It is a de Polignac number, because none of the positive numbers 2k-141667472255 is a prime.
It is a Duffinian number.
It is a congruent number.
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, 14166747221 + ... + 14166747230.
It is an arithmetic number, because the mean of its divisors is an integer number (42500241678).
Almost surely, 2141667472255 is an apocalyptic number.
141667472255 is a deficient number, since it is larger than the sum of its proper divisors (28333494457).
141667472255 is an equidigital number, since it uses as much as digits as its factorization.
141667472255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28333494456.
The product of its digits is 2822400, while the sum is 50.
The spelling of 141667472255 in words is "one hundred forty-one billion, six hundred sixty-seven million, four hundred seventy-two thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •