Base | Representation |
---|---|
bin | 1000000111110110101… |
… | …1110111000110100001 |
3 | 111100012022102202020010 |
4 | 2001331223313012201 |
5 | 4241243141301421 |
6 | 144035101235133 |
7 | 13040056025445 |
oct | 2017553670641 |
9 | 440168382203 |
10 | 139547603361 |
11 | 541aaa90921 |
12 | 23066262aa9 |
13 | 1020bc3648a |
14 | 6a7b508825 |
15 | 396b15d076 |
hex | 207daf71a1 |
139547603361 has 16 divisors (see below), whose sum is σ = 189395029760. Its totient is φ = 91378160640.
The previous prime is 139547603341. The next prime is 139547603431. The reversal of 139547603361 is 163306745931.
It is not a de Polignac number, because 139547603361 - 27 = 139547603233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 139547603361.
It is not an unprimeable number, because it can be changed into a prime (139547603341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1479670 + ... + 1571151.
It is an arithmetic number, because the mean of its divisors is an integer number (11837189360).
Almost surely, 2139547603361 is an apocalyptic number.
It is an amenable number.
139547603361 is a deficient number, since it is larger than the sum of its proper divisors (49847426399).
139547603361 is a wasteful number, since it uses less digits than its factorization.
139547603361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3051096.
The product of its (nonzero) digits is 1224720, while the sum is 48.
The spelling of 139547603361 in words is "one hundred thirty-nine billion, five hundred forty-seven million, six hundred three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •