Base | Representation |
---|---|
bin | 1000000011001100101… |
… | …1111001001110010000 |
3 | 111012222012112120010021 |
4 | 2000303023321032100 |
5 | 4231213203200311 |
6 | 143311051513224 |
7 | 12664101064054 |
oct | 2006313711620 |
9 | 435865476107 |
10 | 138297709456 |
11 | 537194a7055 |
12 | 22977758814 |
13 | 1006ccc2c9a |
14 | 699d50bc64 |
15 | 38e6569171 |
hex | 20332f9390 |
138297709456 has 45 divisors (see below), whose sum is σ = 269771134801. Its totient is φ = 68682512192.
The previous prime is 138297709441. The next prime is 138297709463. The reversal of 138297709456 is 654907792831.
The square root of 138297709456 is 371884.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 32646707856 + 105651001600 = 180684^2 + 325040^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 138297709394 and 138297709403.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 355520910 + ... + 355521298.
It is a 1-persistent number, because it is pandigital, but 2⋅138297709456 = 276595418912 is not.
Almost surely, 2138297709456 is an apocalyptic number.
138297709456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
138297709456 is the 371884-th square number.
It is an amenable number.
138297709456 is a deficient number, since it is larger than the sum of its proper divisors (131473425345).
138297709456 is an frugal number, since it uses more digits than its factorization.
138297709456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1264 (or 630 counting only the distinct ones).
The product of its (nonzero) digits is 22861440, while the sum is 61.
The spelling of 138297709456 in words is "one hundred thirty-eight billion, two hundred ninety-seven million, seven hundred nine thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •