Base | Representation |
---|---|
bin | 1000001011011011000… |
… | …0001111000011000010 |
3 | 111102200001001010221000 |
4 | 2002312300033003002 |
5 | 4300223243120310 |
6 | 144314102512430 |
7 | 13102563142110 |
oct | 2026660170302 |
9 | 442601033830 |
10 | 140505051330 |
11 | 54651490736 |
12 | 23292a35716 |
13 | 103323c5337 |
14 | 6b2c73aab0 |
15 | 39c52364c0 |
hex | 20b6c0f0c2 |
140505051330 has 128 divisors (see below), whose sum is σ = 442971763200. Its totient is φ = 31007999232.
The previous prime is 140505051329. The next prime is 140505051343. The reversal of 140505051330 is 33150505041.
140505051330 is a `hidden beast` number, since 140 + 5 + 0 + 5 + 0 + 513 + 3 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 140505051294 and 140505051303.
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, 1226937 + ... + 1336556.
It is an arithmetic number, because the mean of its divisors is an integer number (3460716900).
Almost surely, 2140505051330 is an apocalyptic number.
140505051330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140505051330 is an abundant number, since it is smaller than the sum of its proper divisors (302466711870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140505051330 is a wasteful number, since it uses less digits than its factorization.
140505051330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2563545 (or 2563539 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 140505051330 its reverse (33150505041), we get a palindrome (173655556371).
The spelling of 140505051330 in words is "one hundred forty billion, five hundred five million, fifty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •