Base | Representation |
---|---|
bin | 1000001001100010101… |
… | …0000111111110001000 |
3 | 111101100211221122012010 |
4 | 2002120222013332020 |
5 | 4243210013224000 |
6 | 144152024415520 |
7 | 13054222332030 |
oct | 2023052077610 |
9 | 441324848163 |
10 | 140000133000 |
11 | 54412475062 |
12 | 231719175a0 |
13 | 1028190a6b0 |
14 | 6ac16648c0 |
15 | 3995c4ad50 |
hex | 2098a87f88 |
140000133000 has 256 divisors, whose sum is σ = 537601559040. Its totient is φ = 29538432000.
The previous prime is 140000132977. The next prime is 140000133017. The reversal of 140000133000 is 331000041.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 16590 + ... + 529410.
It is an arithmetic number, because the mean of its divisors is an integer number (2100006090).
Almost surely, 2140000133000 is an apocalyptic number.
140000133000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140000133000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (268800779520).
140000133000 is an abundant number, since it is smaller than the sum of its proper divisors (397601426040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140000133000 is a wasteful number, since it uses less digits than its factorization.
140000133000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 512865 (or 512851 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 140000133000 its reverse (331000041), we get a palindrome (140331133041).
The spelling of 140000133000 in words is "one hundred forty billion, one hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •