Base | Representation |
---|---|
bin | 1000001100001000111… |
… | …1000010100001001111 |
3 | 111110011110111111002200 |
4 | 2003002033002201033 |
5 | 4301122101111410 |
6 | 144345143252543 |
7 | 13110422340462 |
oct | 2030217024117 |
9 | 443143444080 |
10 | 140697675855 |
11 | 54740196360 |
12 | 2332744a153 |
13 | 10363299549 |
14 | 6b4a15d2d9 |
15 | 39d70d53c0 |
hex | 20c23c284f |
140697675855 has 192 divisors, whose sum is σ = 285152624640. Its totient is φ = 63504000000.
The previous prime is 140697675823. The next prime is 140697675901. The reversal of 140697675855 is 558576796041.
140697675855 is a `hidden beast` number, since 1 + 40 + 6 + 9 + 7 + 6 + 7 + 585 + 5 = 666.
It is not a de Polignac number, because 140697675855 - 25 = 140697675823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140697675792 and 140697675801.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 187346730 + ... + 187347480.
It is an arithmetic number, because the mean of its divisors is an integer number (1485169920).
Almost surely, 2140697675855 is an apocalyptic number.
140697675855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
140697675855 is an abundant number, since it is smaller than the sum of its proper divisors (144454948785).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140697675855 is a wasteful number, since it uses less digits than its factorization.
140697675855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254 (or 1251 counting only the distinct ones).
The product of its (nonzero) digits is 63504000, while the sum is 63.
The spelling of 140697675855 in words is "one hundred forty billion, six hundred ninety-seven million, six hundred seventy-five thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •