Base | Representation |
---|---|
bin | 1011101011010001101010… |
… | …0101111011101001010000 |
3 | 1200110022101111111001210210 |
4 | 2322310122211323221100 |
5 | 3140314413432231432 |
6 | 43145424314324120 |
7 | 2463344112243234 |
oct | 272643245735120 |
9 | 50408344431723 |
10 | 12838103398992 |
11 | 40aa677753193 |
12 | 153413aa29640 |
13 | 7218218080a1 |
14 | 3255206905c4 |
15 | 173e3645d8cc |
hex | bad1a97ba50 |
12838103398992 has 20 divisors (see below), whose sum is σ = 33165100447520. Its totient is φ = 4279367799648.
The previous prime is 12838103398969. The next prime is 12838103398997. The reversal of 12838103398992 is 29989330183821.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12838103398997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133730243692 + ... + 133730243787.
It is an arithmetic number, because the mean of its divisors is an integer number (1658255022376).
Almost surely, 212838103398992 is an apocalyptic number.
12838103398992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12838103398992 is an abundant number, since it is smaller than the sum of its proper divisors (20326997048528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12838103398992 is a wasteful number, since it uses less digits than its factorization.
12838103398992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267460487490 (or 267460487484 counting only the distinct ones).
The product of its (nonzero) digits is 40310784, while the sum is 66.
The spelling of 12838103398992 in words is "twelve trillion, eight hundred thirty-eight billion, one hundred three million, three hundred ninety-eight thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •