Base | Representation |
---|---|
bin | 1000001100010111000… |
… | …1100011100011000001 |
3 | 111110022121020021220111 |
4 | 2003011301203203001 |
5 | 4301232301240211 |
6 | 144355104111321 |
7 | 13112043142504 |
oct | 2030561434301 |
9 | 443277207814 |
10 | 140757055681 |
11 | 547707632a0 |
12 | 23343305541 |
13 | 1037268a138 |
14 | 6b53db913b |
15 | 39dc414421 |
hex | 20c5c638c1 |
140757055681 has 4 divisors (see below), whose sum is σ = 153553151664. Its totient is φ = 127960959700.
The previous prime is 140757055667. The next prime is 140757055687. The reversal of 140757055681 is 186550757041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 140757055681 - 29 = 140757055169 is a prime.
It is a super-2 number, since 2×1407570556812 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140757055687) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6398047975 + ... + 6398047996.
It is an arithmetic number, because the mean of its divisors is an integer number (38388287916).
Almost surely, 2140757055681 is an apocalyptic number.
140757055681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140757055681 is a deficient number, since it is larger than the sum of its proper divisors (12796095983).
140757055681 is a wasteful number, since it uses less digits than its factorization.
140757055681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12796095982.
The product of its (nonzero) digits is 1176000, while the sum is 49.
The spelling of 140757055681 in words is "one hundred forty billion, seven hundred fifty-seven million, fifty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •