Base | Representation |
---|---|
bin | 11110101001010101000… |
… | …10111100010101110011 |
3 | 10201122221001010110011100 |
4 | 33110222202330111303 |
5 | 114223001040300033 |
6 | 2123422132415443 |
7 | 136034563020345 |
oct | 17245242742563 |
9 | 3648831113140 |
10 | 1052980790643 |
11 | 376626229091 |
12 | 1500a9177583 |
13 | 783ac7554c2 |
14 | 38d709bd295 |
15 | 1c5ccb58513 |
hex | f52a8bc573 |
1052980790643 has 12 divisors (see below), whose sum is σ = 1528615332400. Its totient is φ = 698459618736.
The previous prime is 1052980790627. The next prime is 1052980790651. The reversal of 1052980790643 is 3460970892501.
1052980790643 is a `hidden beast` number, since 1 + 0 + 529 + 8 + 0 + 79 + 0 + 6 + 43 = 666.
It is not a de Polignac number, because 1052980790643 - 24 = 1052980790627 is a prime.
It is a super-2 number, since 2×10529807906432 (a number of 25 digits) contains 22 as substring.
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 1052980790643.
It is not an unprimeable number, because it can be changed into a prime (1052980790243) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 293962696 + ... + 293966277.
It is a 1-persistent number, because it is pandigital, but 2⋅1052980790643 = 2105961581286 is not.
Almost surely, 21052980790643 is an apocalyptic number.
1052980790643 is a deficient number, since it is larger than the sum of its proper divisors (475634541757).
1052980790643 is a wasteful number, since it uses less digits than its factorization.
1052980790643 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587929178 (or 587929175 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 1052980790643 in words is "one trillion, fifty-two billion, nine hundred eighty million, seven hundred ninety thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •