Base | Representation |
---|---|
bin | 11110100111101110011… |
… | …11010011111111010101 |
3 | 10201120201001102002110100 |
4 | 33103313033103333111 |
5 | 114214220210202423 |
6 | 2123200503044313 |
7 | 136004341333044 |
oct | 17236717237725 |
9 | 3646631362410 |
10 | 1052120006613 |
11 | 376224351325 |
12 | 14baa8a40699 |
13 | 782a330c840 |
14 | 38ccc55055b |
15 | 1c57c2c6343 |
hex | f4f73d3fd5 |
1052120006613 has 48 divisors (see below), whose sum is σ = 1649001908736. Its totient is φ = 642572524800.
The previous prime is 1052120006603. The next prime is 1052120006617. The reversal of 1052120006613 is 3166000212501.
1052120006613 is a `hidden beast` number, since 1 + 0 + 5 + 21 + 20 + 0 + 0 + 6 + 613 = 666.
It is not a de Polignac number, because 1052120006613 - 216 = 1052119941077 is a prime.
It is a super-2 number, since 2×10521200066132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052120006617) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19353556 + ... + 19407842.
It is an arithmetic number, because the mean of its divisors is an integer number (34354206432).
Almost surely, 21052120006613 is an apocalyptic number.
1052120006613 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1052120006613 is a deficient number, since it is larger than the sum of its proper divisors (596881902123).
1052120006613 is a wasteful number, since it uses less digits than its factorization.
1052120006613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55554 (or 55551 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 1052120006613 in words is "one trillion, fifty-two billion, one hundred twenty million, six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •