Base | Representation |
---|---|
bin | 1000001000011010011… |
… | …0001000001110001001 |
3 | 111100120201201201222021 |
4 | 2002012212020032021 |
5 | 4242044424024221 |
6 | 144102001324441 |
7 | 13043552501662 |
oct | 2020646101611 |
9 | 440521651867 |
10 | 139697095561 |
11 | 542774065a1 |
12 | 230a8336721 |
13 | 10233bb81ba |
14 | 6a93300369 |
15 | 397933c041 |
hex | 2086988389 |
139697095561 has 2 divisors, whose sum is σ = 139697095562. Its totient is φ = 139697095560.
The previous prime is 139697095537. The next prime is 139697095591. The reversal of 139697095561 is 165590796931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137896366336 + 1800729225 = 371344^2 + 42435^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139697095561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 139697095561.
It is not a weakly prime, because it can be changed into another prime (139697095501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69848547780 + 69848547781.
It is an arithmetic number, because the mean of its divisors is an integer number (69848547781).
Almost surely, 2139697095561 is an apocalyptic number.
It is an amenable number.
139697095561 is a deficient number, since it is larger than the sum of its proper divisors (1).
139697095561 is an equidigital number, since it uses as much as digits as its factorization.
139697095561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13778100, while the sum is 61.
The spelling of 139697095561 in words is "one hundred thirty-nine billion, six hundred ninety-seven million, ninety-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •