Base | Representation |
---|---|
bin | 1000001111111001001… |
… | …1010011100110010110 |
3 | 111112202200202120021010 |
4 | 2003332103103212112 |
5 | 4310203042133400 |
6 | 145033143033050 |
7 | 13144410154464 |
oct | 2037623234626 |
9 | 445680676233 |
10 | 141705427350 |
11 | 55108023a33 |
12 | 23568a3b786 |
13 | 10493cbb9c6 |
14 | 6c03d27834 |
15 | 3a457e8450 |
hex | 20fe4d3996 |
141705427350 has 48 divisors (see below), whose sum is σ = 353585529792. Its totient is φ = 37556278560.
The previous prime is 141705427343. The next prime is 141705427361. The reversal of 141705427350 is 53724507141.
141705427350 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1417054273502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141705427299 and 141705427308.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2873412 + ... + 2922311.
It is an arithmetic number, because the mean of its divisors is an integer number (7366365204).
Almost surely, 2141705427350 is an apocalyptic number.
141705427350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141705427350 is an abundant number, since it is smaller than the sum of its proper divisors (211880102442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141705427350 is a wasteful number, since it uses less digits than its factorization.
141705427350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5795901 (or 5795896 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 39.
The spelling of 141705427350 in words is "one hundred forty-one billion, seven hundred five million, four hundred twenty-seven thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •