Base | Representation |
---|---|
bin | 11111001001001000001… |
… | …01100100011011000100 |
3 | 10210021222210011210111220 |
4 | 33210210011210123010 |
5 | 120012431341441023 |
6 | 2135324130200340 |
7 | 140210615306205 |
oct | 17444405443304 |
9 | 3707883153456 |
10 | 1070052296388 |
11 | 382896697019 |
12 | 1534724230b0 |
13 | 79ba04c38aa |
14 | 39b0dd935ac |
15 | 1cc7b7573e3 |
hex | f9241646c4 |
1070052296388 has 12 divisors (see below), whose sum is σ = 2496788691600. Its totient is φ = 356684098792.
The previous prime is 1070052296371. The next prime is 1070052296429. The reversal of 1070052296388 is 8836922500701.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×10700522963882 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1070052296388.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44585512338 + ... + 44585512361.
It is an arithmetic number, because the mean of its divisors is an integer number (208065724300).
Almost surely, 21070052296388 is an apocalyptic number.
It is an amenable number.
1070052296388 is an abundant number, since it is smaller than the sum of its proper divisors (1426736395212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1070052296388 is a wasteful number, since it uses less digits than its factorization.
1070052296388 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89171024706 (or 89171024704 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 1070052296388 in words is "one trillion, seventy billion, fifty-two million, two hundred ninety-six thousand, three hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •