Base | Representation |
---|---|
bin | 1000000100001100111… |
… | …0001001110110000000 |
3 | 111020122221202120220202 |
4 | 2001003032021312000 |
5 | 4232241041043110 |
6 | 143353502024332 |
7 | 13003545555536 |
oct | 2010316116600 |
9 | 436587676822 |
10 | 138566737280 |
11 | 538473466a4 |
12 | 22a318780a8 |
13 | 100b396844a |
14 | 69c713c156 |
15 | 390eeab0a5 |
hex | 2043389d80 |
138566737280 has 64 divisors (see below), whose sum is σ = 331306567200. Its totient is φ = 55419088896.
The previous prime is 138566737271. The next prime is 138566737289. The reversal of 138566737280 is 82737665831.
It is an interprime number because it is at equal distance from previous prime (138566737271) and next prime (138566737289).
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138566737289) 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 in 7 ways as a sum of consecutive naturals, for example, 8189309 + ... + 8206211.
Almost surely, 2138566737280 is an apocalyptic number.
138566737280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
138566737280 is an abundant number, since it is smaller than the sum of its proper divisors (192739829920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138566737280 is a wasteful number, since it uses less digits than its factorization.
138566737280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29731 (or 29719 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 56.
The spelling of 138566737280 in words is "one hundred thirty-eight billion, five hundred sixty-six million, seven hundred thirty-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •