Base | Representation |
---|---|
bin | 1001101011011100100111… |
… | …1010000001111110100111 |
3 | 1101200100220202210212201000 |
4 | 2122313021322001332213 |
5 | 2343324324441100223 |
6 | 34344513244204343 |
7 | 2145601132410540 |
oct | 232671172017647 |
9 | 41610822725630 |
10 | 10642021425063 |
11 | 343328a726186 |
12 | 123a5b35396b3 |
13 | 5c26cc8a4592 |
14 | 28b1102154c7 |
15 | 136c53e8d543 |
hex | 9adc9e81fa7 |
10642021425063 has 64 divisors (see below), whose sum is σ = 18263790858240. Its totient is φ = 5998725216000.
The previous prime is 10642021425059. The next prime is 10642021425097. The reversal of 10642021425063 is 36052412024601.
10642021425063 is a `hidden beast` number, since 1 + 0 + 6 + 4 + 2 + 0 + 2 + 142 + 506 + 3 = 666.
It is not a de Polignac number, because 10642021425063 - 22 = 10642021425059 is a prime.
It is a super-2 number, since 2×106420214250632 (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 (10642021425023) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4144531 + ... + 6201707.
It is an arithmetic number, because the mean of its divisors is an integer number (285371732160).
Almost surely, 210642021425063 is an apocalyptic number.
10642021425063 is a deficient number, since it is larger than the sum of its proper divisors (7621769433177).
10642021425063 is a wasteful number, since it uses less digits than its factorization.
10642021425063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2057565 (or 2057559 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 10642021425063 its reverse (36052412024601), we get a palindrome (46694433449664).
The spelling of 10642021425063 in words is "ten trillion, six hundred forty-two billion, twenty-one million, four hundred twenty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •