Base | Representation |
---|---|
bin | 11110101000010010001… |
… | …10010111011011111000 |
3 | 10201121110221020121201110 |
4 | 33110021012113123320 |
5 | 114220323412320240 |
6 | 2123250325320320 |
7 | 136014640302552 |
oct | 17241106273370 |
9 | 3647427217643 |
10 | 1052419651320 |
11 | 376368502884 |
12 | 14bb712660a0 |
13 | 783204149bb |
14 | 38d1a2704d2 |
15 | 1c598764c80 |
hex | f5091976f8 |
1052419651320 has 128 divisors (see below), whose sum is σ = 3256048319040. Its totient is φ = 271926927360.
The previous prime is 1052419651313. The next prime is 1052419651333. The reversal of 1052419651320 is 231569142501.
It is a happy number.
It is a super-2 number, since 2×10524196513202 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 578274 + ... + 1561806.
Almost surely, 21052419651320 is an apocalyptic number.
1052419651320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1052419651320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1628024159520).
1052419651320 is an abundant number, since it is smaller than the sum of its proper divisors (2203628667720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052419651320 is a wasteful number, since it uses less digits than its factorization.
1052419651320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983825 (or 983821 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 1052419651320 in words is "one trillion, fifty-two billion, four hundred nineteen million, six hundred fifty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •