Base | Representation |
---|---|
bin | 1001101100101101000110… |
… | …0001011110011001001110 |
3 | 1101202102200021221112011220 |
4 | 2123023101201132121032 |
5 | 2344203100223321222 |
6 | 34402445023224210 |
7 | 2150264354544315 |
oct | 233132141363116 |
9 | 41672607845156 |
10 | 10663624042062 |
11 | 3441465854062 |
12 | 1242822148066 |
13 | 5c47632c01a4 |
14 | 28c19d2b327c |
15 | 1375ba773b5c |
hex | 9b2d185e64e |
10663624042062 has 16 divisors (see below), whose sum is σ = 21332241637632. Its totient is φ = 3553709088440.
The previous prime is 10663624042061. The next prime is 10663624042079. The reversal of 10663624042062 is 26024042636601.
10663624042062 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×106636240420622 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10663624042061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208036968 + ... + 208088219.
It is an arithmetic number, because the mean of its divisors is an integer number (1333265102352).
Almost surely, 210663624042062 is an apocalyptic number.
10663624042062 is an abundant number, since it is smaller than the sum of its proper divisors (10668617595570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10663624042062 is a wasteful number, since it uses less digits than its factorization.
10663624042062 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416129463.
The product of its (nonzero) digits is 497664, while the sum is 42.
Adding to 10663624042062 its reverse (26024042636601), we get a palindrome (36687666678663).
The spelling of 10663624042062 in words is "ten trillion, six hundred sixty-three billion, six hundred twenty-four million, forty-two thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •