Base | Representation |
---|---|
bin | 1000001100110010111… |
… | …0000101000000001010 |
3 | 111110121201111120121020 |
4 | 2003030232011000022 |
5 | 4302002114202100 |
6 | 144414425453310 |
7 | 13114656466221 |
oct | 2031456050012 |
9 | 443551446536 |
10 | 140873584650 |
11 | 54820514227 |
12 | 23376341236 |
13 | 1039086a1a6 |
14 | 6b6566dcb8 |
15 | 39e77815a0 |
hex | 20ccb8500a |
140873584650 has 72 divisors (see below), whose sum is σ = 371126454720. Its totient is φ = 35356496640.
The previous prime is 140873584637. The next prime is 140873584661. The reversal of 140873584650 is 56485378041.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 140873584593 and 140873584602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1581490 + ... + 1668189.
Almost surely, 2140873584650 is an apocalyptic number.
140873584650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140873584650 is an abundant number, since it is smaller than the sum of its proper divisors (230252870070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140873584650 is a wasteful number, since it uses less digits than its factorization.
140873584650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3249728 (or 3249706 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 51.
The spelling of 140873584650 in words is "one hundred forty billion, eight hundred seventy-three million, five hundred eighty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •