Base | Representation |
---|---|
bin | 11110111100011000101… |
… | …00010011011111000011 |
3 | 10202122100000011201122211 |
4 | 33132030110103133003 |
5 | 114404424012230133 |
6 | 2132233222442551 |
7 | 136546234566154 |
oct | 17361424233703 |
9 | 3678300151584 |
10 | 1063211055043 |
11 | 37a9a5a17155 |
12 | 152083293457 |
13 | 793500653a7 |
14 | 3966156192b |
15 | 1c9cad4cbcd |
hex | f78c5137c3 |
1063211055043 has 4 divisors (see below), whose sum is σ = 1063748303640. Its totient is φ = 1062673806448.
The previous prime is 1063211055041. The next prime is 1063211055091. The reversal of 1063211055043 is 3405501123601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1063211055043 - 21 = 1063211055041 is a prime.
It is a super-2 number, since 2×10632110550432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1063211054996 and 1063211055014.
It is not an unprimeable number, because it can be changed into a prime (1063211055041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 268621330 + ... + 268625287.
It is an arithmetic number, because the mean of its divisors is an integer number (265937075910).
Almost surely, 21063211055043 is an apocalyptic number.
1063211055043 is a deficient number, since it is larger than the sum of its proper divisors (537248597).
1063211055043 is an equidigital number, since it uses as much as digits as its factorization.
1063211055043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 537248596.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 1063211055043 its reverse (3405501123601), we get a palindrome (4468712178644).
The spelling of 1063211055043 in words is "one trillion, sixty-three billion, two hundred eleven million, fifty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •