Base | Representation |
---|---|
bin | 1011010001011011001010… |
… | …1110110111110011010000 |
3 | 1121212212000201121020102120 |
4 | 2310112302232313303100 |
5 | 3111030332143434332 |
6 | 42205414313214240 |
7 | 2416302234441510 |
oct | 264266256676320 |
9 | 47785021536376 |
10 | 12393979280592 |
11 | 3a49291214638 |
12 | 1482052701380 |
13 | 6bb993889460 |
14 | 30bc2c2db840 |
15 | 1675e0e8c32c |
hex | b45b2bb7cd0 |
12393979280592 has 80 divisors (see below), whose sum is σ = 39406498239360. Its totient is φ = 3268741787136.
The previous prime is 12393979280591. The next prime is 12393979280603. The reversal of 12393979280592 is 29508297939321.
It is a super-2 number, since 2×123939792805922 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12393979280591) 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, 1418720367 + ... + 1418729102.
It is an arithmetic number, because the mean of its divisors is an integer number (492581227992).
Almost surely, 212393979280592 is an apocalyptic number.
12393979280592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12393979280592 is an abundant number, since it is smaller than the sum of its proper divisors (27012518958768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12393979280592 is a wasteful number, since it uses less digits than its factorization.
12393979280592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2837449500 (or 2837449494 counting only the distinct ones).
The product of its (nonzero) digits is 132269760, while the sum is 69.
The spelling of 12393979280592 in words is "twelve trillion, three hundred ninety-three billion, nine hundred seventy-nine million, two hundred eighty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •