Base | Representation |
---|---|
bin | 11111110111011000100011… |
… | …001010000100101000100110 |
3 | 200101012202200222122102220210 |
4 | 133313120203022010220212 |
5 | 121332120210403231322 |
6 | 1214021521224440250 |
7 | 41343111660661146 |
oct | 3767304312045046 |
9 | 611182628572823 |
10 | 140145372711462 |
11 | 40722356349a98 |
12 | 13875141919086 |
13 | 6027862409ab1 |
14 | 26871022ba926 |
15 | 1130781c3770c |
hex | 7f7623284a26 |
140145372711462 has 32 divisors (see below), whose sum is σ = 280424921414400. Its totient is φ = 46692766931040.
The previous prime is 140145372711433. The next prime is 140145372711467. The reversal of 140145372711462 is 264117273541041.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140145372711467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104596039 + ... + 105927437.
It is an arithmetic number, because the mean of its divisors is an integer number (8763278794200).
Almost surely, 2140145372711462 is an apocalyptic number.
140145372711462 is an abundant number, since it is smaller than the sum of its proper divisors (140279548702938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140145372711462 is a wasteful number, since it uses less digits than its factorization.
140145372711462 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339788.
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 140145372711462 in words is "one hundred forty trillion, one hundred forty-five billion, three hundred seventy-two million, seven hundred eleven thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •