Base | Representation |
---|---|
bin | 1000000110110000010… |
… | …1001011110110010011 |
3 | 111022102201200100101201 |
4 | 2001230011023312103 |
5 | 4240142034031201 |
6 | 143545511012031 |
7 | 13026541420063 |
oct | 2015405136623 |
9 | 438381610351 |
10 | 139252252051 |
11 | 540692a2030 |
12 | 22ba336a017 |
13 | 101929a55a3 |
14 | 6a501c53a3 |
15 | 395026b801 |
hex | 206c14bd93 |
139252252051 has 4 divisors (see below), whose sum is σ = 151911547704. Its totient is φ = 126592956400.
The previous prime is 139252252039. The next prime is 139252252093. The reversal of 139252252051 is 150252252931.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 139252252051 - 211 = 139252250003 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 139252252051.
It is not an unprimeable number, because it can be changed into a prime (139252252021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6329647810 + ... + 6329647831.
It is an arithmetic number, because the mean of its divisors is an integer number (37977886926).
Almost surely, 2139252252051 is an apocalyptic number.
139252252051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
139252252051 is a deficient number, since it is larger than the sum of its proper divisors (12659295653).
139252252051 is a wasteful number, since it uses less digits than its factorization.
139252252051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12659295652.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 139252252051 in words is "one hundred thirty-nine billion, two hundred fifty-two million, two hundred fifty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •