Base | Representation |
---|---|
bin | 1000001010100001101… |
… | …1110010010100010111 |
3 | 111102001021222121102202 |
4 | 2002220123302110113 |
5 | 4244230242403001 |
6 | 144234201355115 |
7 | 13063615132253 |
oct | 2025033622427 |
9 | 442037877382 |
10 | 140264809751 |
11 | 54538912680 |
12 | 23226498a9b |
13 | 102c46bb561 |
14 | 6b08881263 |
15 | 39ae0cd96b |
hex | 20a86f2517 |
140264809751 has 16 divisors (see below), whose sum is σ = 153514116000. Its totient is φ = 127098787200.
The previous prime is 140264809723. The next prime is 140264809801. The reversal of 140264809751 is 157908462041.
It is a happy number.
It is not a de Polignac number, because 140264809751 - 234 = 123084940567 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140264809696 and 140264809705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140264809151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13004981 + ... + 13015761.
It is an arithmetic number, because the mean of its divisors is an integer number (9594632250).
Almost surely, 2140264809751 is an apocalyptic number.
140264809751 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140264809751 is a deficient number, since it is larger than the sum of its proper divisors (13249306249).
140264809751 is a wasteful number, since it uses less digits than its factorization.
140264809751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14530.
The product of its (nonzero) digits is 483840, while the sum is 47.
The spelling of 140264809751 in words is "one hundred forty billion, two hundred sixty-four million, eight hundred nine thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •