Base | Representation |
---|---|
bin | 10011100110110111101… |
… | …110001010000100100000 |
3 | 11202210220010011100120020 |
4 | 103212313232022010200 |
5 | 134033442204002143 |
6 | 2510553522113440 |
7 | 166230001220511 |
oct | 23466756120440 |
9 | 4683803140506 |
10 | 1347407094048 |
11 | 47a4831a5664 |
12 | 199177aab880 |
13 | 9a0a1909192 |
14 | 493017a2a08 |
15 | 250b0d3b883 |
hex | 139b7b8a120 |
1347407094048 has 192 divisors, whose sum is σ = 3613575224448. Its totient is φ = 439525048320.
The previous prime is 1347407094041. The next prime is 1347407094049. The reversal of 1347407094048 is 8404907047431.
It is not an unprimeable number, because it can be changed into a prime (1347407094041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 758247336 + ... + 758249112.
It is an arithmetic number, because the mean of its divisors is an integer number (18820704294).
Almost surely, 21347407094048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1347407094048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1806787612224).
1347407094048 is an abundant number, since it is smaller than the sum of its proper divisors (2266168130400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1347407094048 is a wasteful number, since it uses less digits than its factorization.
1347407094048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2755 (or 2747 counting only the distinct ones).
The product of its (nonzero) digits is 2709504, while the sum is 51.
The spelling of 1347407094048 in words is "one trillion, three hundred forty-seven billion, four hundred seven million, ninety-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •