Base | Representation |
---|---|
bin | 11111110111001110010000… |
… | …100110100101010101101110 |
3 | 200101011201011222112202021020 |
4 | 133313032100212211111232 |
5 | 121331430043421000420 |
6 | 1214012453020315010 |
7 | 41342241120325536 |
oct | 3767162046452556 |
9 | 611151158482236 |
10 | 140134324000110 |
11 | 407186a6670690 |
12 | 13872b796a2a66 |
13 | 60267c138877b |
14 | 2686774b6a4c6 |
15 | 1130336c75340 |
hex | 7f73909a556e |
140134324000110 has 64 divisors (see below), whose sum is σ = 368818066796544. Its totient is φ = 33794093667200.
The previous prime is 140134324000091. The next prime is 140134324000193. The reversal of 140134324000110 is 11000423431041.
140134324000110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1111584789 + ... + 1111710848.
It is an arithmetic number, because the mean of its divisors is an integer number (5762782293696).
Almost surely, 2140134324000110 is an apocalyptic number.
140134324000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140134324000110 is an abundant number, since it is smaller than the sum of its proper divisors (228683742796434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140134324000110 is a wasteful number, since it uses less digits than its factorization.
140134324000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2223295849.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 140134324000110 its reverse (11000423431041), we get a palindrome (151134747431151).
The spelling of 140134324000110 in words is "one hundred forty trillion, one hundred thirty-four billion, three hundred twenty-four million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •