Base | Representation |
---|---|
bin | 1000001110000000101… |
… | …1010110001101100100 |
3 | 111111110110202102210002 |
4 | 2003200023112031210 |
5 | 4303134201240140 |
6 | 144511050320432 |
7 | 13126032255530 |
oct | 2034013261544 |
9 | 444413672702 |
10 | 141200024420 |
11 | 54978807264 |
12 | 23447729118 |
13 | 10413394610 |
14 | 6b96b66bc0 |
15 | 3a16264415 |
hex | 20e02d6364 |
141200024420 has 48 divisors (see below), whose sum is σ = 364947760128. Its totient is φ = 44687479680.
The previous prime is 141200024401. The next prime is 141200024423. The reversal of 141200024420 is 24420002141.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 141200024392 and 141200024401.
It is not an unprimeable number, because it can be changed into a prime (141200024423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38789396 + ... + 38793035.
It is an arithmetic number, because the mean of its divisors is an integer number (7603078336).
Almost surely, 2141200024420 is an apocalyptic number.
141200024420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141200024420 is an abundant number, since it is smaller than the sum of its proper divisors (223747735708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141200024420 is a wasteful number, since it uses less digits than its factorization.
141200024420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77582460 (or 77582458 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 141200024420 its reverse (24420002141), we get a palindrome (165620026561).
The spelling of 141200024420 in words is "one hundred forty-one billion, two hundred million, twenty-four thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •