Base | Representation |
---|---|
bin | 100000000110101110110111… |
… | …000111100010100110001000 |
3 | 200111221121012021122002212101 |
4 | 200012232313013202212020 |
5 | 122001410322222010430 |
6 | 1220150235055523144 |
7 | 41512241440355452 |
oct | 4006566707424610 |
9 | 614847167562771 |
10 | 141200122063240 |
11 | 40a996a9909249 |
12 | 13a056432294b4 |
13 | 60a3164395476 |
14 | 26c219db0b2d2 |
15 | 114ce14c88dca |
hex | 806bb71e2988 |
141200122063240 has 64 divisors (see below), whose sum is σ = 333365360227200. Its totient is φ = 53722582205952.
The previous prime is 141200122063219. The next prime is 141200122063283. The reversal of 141200122063240 is 42360221002141.
It is a junction number, because it is equal to n+sod(n) for n = 141200122063199 and 141200122063208.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 428545917 + ... + 428875276.
It is an arithmetic number, because the mean of its divisors is an integer number (5208833753550).
Almost surely, 2141200122063240 is an apocalyptic number.
141200122063240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141200122063240 is an abundant number, since it is smaller than the sum of its proper divisors (192165238163960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141200122063240 is a wasteful number, since it uses less digits than its factorization.
141200122063240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857421406 (or 857421402 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 141200122063240 its reverse (42360221002141), we get a palindrome (183560343065381).
The spelling of 141200122063240 in words is "one hundred forty-one trillion, two hundred billion, one hundred twenty-two million, sixty-three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •