Base | Representation |
---|---|
bin | 10010000010000101001… |
… | …011110110001001001000 |
3 | 11101110112221022012220222 |
4 | 102002011023312021020 |
5 | 130300322333300303 |
6 | 2345135044205212 |
7 | 155346106120532 |
oct | 22020513661110 |
9 | 4343487265828 |
10 | 1239185056328 |
11 | 43859872796a |
12 | 1801b4699808 |
13 | 8cb1588457b |
14 | 43d9679a852 |
15 | 22379d97938 |
hex | 120852f6248 |
1239185056328 has 12 divisors (see below), whose sum is σ = 2323477884195. Its totient is φ = 619590953880.
The previous prime is 1239185056327. The next prime is 1239185056393. The reversal of 1239185056328 is 8236505819321.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 619592528164 + 619592528164 = 787142^2 + 787142^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=787142.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1239185056328.
It is not an unprimeable number, because it can be changed into a prime (1239185056321) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 2951783 + ... + 3345353.
Almost surely, 21239185056328 is an apocalyptic number.
It is an amenable number.
1239185056328 is a deficient number, since it is larger than the sum of its proper divisors (1084292827867).
1239185056328 is an frugal number, since it uses more digits than its factorization.
1239185056328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787148 (or 393573 counting only the distinct ones).
The product of its (nonzero) digits is 3110400, while the sum is 53.
The spelling of 1239185056328 in words is "one trillion, two hundred thirty-nine billion, one hundred eighty-five million, fifty-six thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •