Base | Representation |
---|---|
bin | 1000001101001011011… |
… | …0001000110110011111 |
3 | 111110212212220011001122 |
4 | 2003102312020312133 |
5 | 4302204422021423 |
6 | 144432540401155 |
7 | 13120345203302 |
oct | 2032266106637 |
9 | 443785804048 |
10 | 140976360863 |
11 | 54873531548 |
12 | 233a48461bb |
13 | 103a8c43510 |
14 | 6b75184b39 |
15 | 3a017d38c8 |
hex | 20d2d88d9f |
140976360863 has 32 divisors (see below), whose sum is σ = 158599848960. Its totient is φ = 124488524160.
The previous prime is 140976360859. The next prime is 140976360871. The reversal of 140976360863 is 368063679041.
140976360863 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 140976360863 - 22 = 140976360859 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140976360823) 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 31 ways as a sum of consecutive naturals, for example, 4180556 + ... + 4214142.
It is an arithmetic number, because the mean of its divisors is an integer number (4956245280).
Almost surely, 2140976360863 is an apocalyptic number.
140976360863 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140976360863 is a deficient number, since it is larger than the sum of its proper divisors (17623488097).
140976360863 is a wasteful number, since it uses less digits than its factorization.
140976360863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33807.
The product of its (nonzero) digits is 3919104, while the sum is 53.
The spelling of 140976360863 in words is "one hundred forty billion, nine hundred seventy-six million, three hundred sixty thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •