Base | Representation |
---|---|
bin | 10100001101011111101… |
… | …110101010100100111011 |
3 | 11220202221110200221010011 |
4 | 110031133232222210323 |
5 | 140223411402131042 |
6 | 2542013133202351 |
7 | 202225516335502 |
oct | 24153756524473 |
9 | 4822843627104 |
10 | 1388880505147 |
11 | 496025923223 |
12 | 1a52113303b7 |
13 | a0c81001515 |
14 | 4b317911839 |
15 | 261dbd69a17 |
hex | 1435fbaa93b |
1388880505147 has 16 divisors (see below), whose sum is σ = 1415915438080. Its totient is φ = 1362118397472.
The previous prime is 1388880505141. The next prime is 1388880505153. The reversal of 1388880505147 is 7415050888831.
It is an interprime number because it is at equal distance from previous prime (1388880505141) and next prime (1388880505153).
It is a cyclic number.
It is not a de Polignac number, because 1388880505147 - 211 = 1388880503099 is a prime.
It is a super-3 number, since 3×13888805051473 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1388880505091 and 1388880505100.
It is not an unprimeable number, because it can be changed into a prime (1388880505141) 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, 24030598 + ... + 24088324.
It is an arithmetic number, because the mean of its divisors is an integer number (88494714880).
Almost surely, 21388880505147 is an apocalyptic number.
1388880505147 is a deficient number, since it is larger than the sum of its proper divisors (27034932933).
1388880505147 is a wasteful number, since it uses less digits than its factorization.
1388880505147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60082.
The product of its (nonzero) digits is 8601600, while the sum is 58.
The spelling of 1388880505147 in words is "one trillion, three hundred eighty-eight billion, eight hundred eighty million, five hundred five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •