Base | Representation |
---|---|
bin | 10010101100111110100… |
… | …10111000011010101101 |
3 | 2021102201110220020002200 |
4 | 21112133102320122231 |
5 | 41012042344413000 |
6 | 1211114453412113 |
7 | 64266534301524 |
oct | 11263722703255 |
9 | 2242643806080 |
10 | 642622654125 |
11 | 22859780a491 |
12 | a466503a039 |
13 | 487a31851ca |
14 | 23162cad4bb |
15 | 11ab1c0c500 |
hex | 959f4b86ad |
642622654125 has 48 divisors (see below), whose sum is σ = 1159751135088. Its totient is φ = 342342528000.
The previous prime is 642622654097. The next prime is 642622654129. The reversal of 642622654125 is 521456226246.
642622654125 is a `hidden beast` number, since 6 + 4 + 2 + 6 + 226 + 5 + 412 + 5 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 226322838756 + 416299815369 = 475734^2 + 645213^2 .
It is not a de Polignac number, because 642622654125 - 213 = 642622645933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642622654129) 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, 666937 + ... + 1315313.
It is an arithmetic number, because the mean of its divisors is an integer number (24161481981).
Almost surely, 2642622654125 is an apocalyptic number.
It is an amenable number.
642622654125 is a deficient number, since it is larger than the sum of its proper divisors (517128480963).
642622654125 is a wasteful number, since it uses less digits than its factorization.
642622654125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649279 (or 649266 counting only the distinct ones).
The product of its digits is 1382400, while the sum is 45.
The spelling of 642622654125 in words is "six hundred forty-two billion, six hundred twenty-two million, six hundred fifty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •