Base | Representation |
---|---|
bin | 11110111101001011001… |
… | …00001011010010000001 |
3 | 10202200102112020101102011 |
4 | 33132211210023102001 |
5 | 114411310432134040 |
6 | 2132343233452521 |
7 | 136562600214511 |
oct | 17364544132201 |
9 | 3680375211364 |
10 | 1063634646145 |
11 | 3800a3035445 |
12 | 152181111141 |
13 | 793b9a46806 |
14 | 396a1907841 |
15 | 1ca031213ea |
hex | f7a590b481 |
1063634646145 has 12 divisors (see below), whose sum is σ = 1334268342036. Its totient is φ = 813911727200.
The previous prime is 1063634646119. The next prime is 1063634646161. The reversal of 1063634646145 is 5416464363601.
It can be written as a sum of positive squares in 2 ways, for example, as 450922994064 + 612711652081 = 671508^2 + 782759^2 .
It is not a de Polignac number, because 1063634646145 - 223 = 1063626257537 is a prime.
It is a super-2 number, since 2×10636346461452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 201062506 + ... + 201067795.
It is an arithmetic number, because the mean of its divisors is an integer number (111189028503).
Almost surely, 21063634646145 is an apocalyptic number.
It is an amenable number.
1063634646145 is a deficient number, since it is larger than the sum of its proper divisors (270633695891).
1063634646145 is an equidigital number, since it uses as much as digits as its factorization.
1063634646145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402130352 (or 402130329 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 49.
The spelling of 1063634646145 in words is "one trillion, sixty-three billion, six hundred thirty-four million, six hundred forty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •