Base | Representation |
---|---|
bin | 11111101010011001011011… |
… | …100011011110000111010001 |
3 | 200021001110020121101221021021 |
4 | 133222121123203132013101 |
5 | 121223010033204232303 |
6 | 1212055532421155441 |
7 | 41221460206336504 |
oct | 3752313343360721 |
9 | 607043217357237 |
10 | 139252965695953 |
11 | 4040893a8aa89a |
12 | 137501a855bb81 |
13 | 5c91662a67225 |
14 | 2655c454cd13b |
15 | 1117451108ebd |
hex | 7ea65b8de1d1 |
139252965695953 has 2 divisors, whose sum is σ = 139252965695954. Its totient is φ = 139252965695952.
The previous prime is 139252965695923. The next prime is 139252965696007. The reversal of 139252965695953 is 359596569252931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86331749254144 + 52921216441809 = 9291488^2 + 7274697^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139252965695953 is a prime.
It is not a weakly prime, because it can be changed into another prime (139252965695923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69626482847976 + 69626482847977.
It is an arithmetic number, because the mean of its divisors is an integer number (69626482847977).
Almost surely, 2139252965695953 is an apocalyptic number.
It is an amenable number.
139252965695953 is a deficient number, since it is larger than the sum of its proper divisors (1).
139252965695953 is an equidigital number, since it uses as much as digits as its factorization.
139252965695953 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5314410000, while the sum is 79.
The spelling of 139252965695953 in words is "one hundred thirty-nine trillion, two hundred fifty-two billion, nine hundred sixty-five million, six hundred ninety-five thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •