Base | Representation |
---|---|
bin | 1000000111000001000… |
… | …0010100110001111001 |
3 | 111022121121110012011111 |
4 | 2001300100110301321 |
5 | 4240313000443311 |
6 | 144000452000321 |
7 | 13031351564254 |
oct | 2016020246171 |
9 | 438547405144 |
10 | 139322281081 |
11 | 540a4882965 |
12 | 230029000a1 |
13 | 101a4354399 |
14 | 6a5961409b |
15 | 39564a0d21 |
hex | 2070414c79 |
139322281081 has 27 divisors (see below), whose sum is σ = 147394921869. Its totient is φ = 131685775200.
The previous prime is 139322281067. The next prime is 139322281129. The reversal of 139322281081 is 180182223931.
The square root of 139322281081 is 373259.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 41803482681 + 97518798400 = 204459^2 + 312280^2 .
It is not a de Polignac number, because 139322281081 - 27 = 139322280953 is a prime.
It is a super-2 number, since 2×1393222810812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (139322281381) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 660295066 + ... + 660295276.
Almost surely, 2139322281081 is an apocalyptic number.
139322281081 is the 373259-th square number.
139322281081 is the 186630-th centered octagonal number.
It is an amenable number.
139322281081 is a deficient number, since it is larger than the sum of its proper divisors (8072640788).
139322281081 is an frugal number, since it uses more digits than its factorization.
139322281081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 602 (or 301 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 40.
The spelling of 139322281081 in words is "one hundred thirty-nine billion, three hundred twenty-two million, two hundred eighty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •