Base | Representation |
---|---|
bin | 11111111000001011100111… |
… | …101111000010010001011000 |
3 | 200101102000020201022202110002 |
4 | 133320023213233002101120 |
5 | 121334020012321434000 |
6 | 1214103030521312132 |
7 | 41350062624106013 |
oct | 3770134757022130 |
9 | 611360221282402 |
10 | 140200210343000 |
11 | 407436367aa235 |
12 | 138838a6935648 |
13 | 602ca91498892 |
14 | 2689a252c437a |
15 | 1131de115e8d5 |
hex | 7f82e7bc2458 |
140200210343000 has 32 divisors (see below), whose sum is σ = 328068492204960. Its totient is φ = 56080084136800.
The previous prime is 140200210342991. The next prime is 140200210343023. The reversal of 140200210343000 is 343012002041.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70100104172 + ... + 70100106171.
It is an arithmetic number, because the mean of its divisors is an integer number (10252140381405).
Almost surely, 2140200210343000 is an apocalyptic number.
140200210343000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140200210343000 is an abundant number, since it is smaller than the sum of its proper divisors (187868281861960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140200210343000 is a wasteful number, since it uses less digits than its factorization.
140200210343000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140200210364 (or 140200210350 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 140200210343000 its reverse (343012002041), we get a palindrome (140543222345041).
The spelling of 140200210343000 in words is "one hundred forty trillion, two hundred billion, two hundred ten million, three hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •