Base | Representation |
---|---|
bin | 1000001100110010100… |
… | …0100101111011111001 |
3 | 111110121121210112002010 |
4 | 2003030220211323321 |
5 | 4302001232143211 |
6 | 144414335000133 |
7 | 13114641330000 |
oct | 2031450457371 |
9 | 443547715063 |
10 | 140872146681 |
11 | 5481a721922 |
12 | 23375969049 |
13 | 10390485816 |
14 | 6b653b7c37 |
15 | 39e759a4a6 |
hex | 20cca25ef9 |
140872146681 has 20 divisors (see below), whose sum is σ = 219121423312. Its totient is φ = 80498365416.
The previous prime is 140872146593. The next prime is 140872146713. The reversal of 140872146681 is 186641278041.
140872146681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140872146681 - 27 = 140872146553 is a prime.
It is a super-2 number, since 2×1408721466812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 140872146681.
It is not an unprimeable number, because it can be changed into a prime (140872141681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9771511 + ... + 9785916.
Almost surely, 2140872146681 is an apocalyptic number.
It is an amenable number.
140872146681 is a deficient number, since it is larger than the sum of its proper divisors (78249276631).
140872146681 is an frugal number, since it uses more digits than its factorization.
140872146681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19557458 (or 19557437 counting only the distinct ones).
The product of its (nonzero) digits is 516096, while the sum is 48.
The spelling of 140872146681 in words is "one hundred forty billion, eight hundred seventy-two million, one hundred forty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •