Base | Representation |
---|---|
bin | 110100110011010000000… |
… | …010011110011110010111 |
3 | 110211212122102002121002220 |
4 | 310303100002132132113 |
5 | 433422022313122423 |
6 | 11414514503433423 |
7 | 523101123064461 |
oct | 64632002363627 |
9 | 13755572077086 |
10 | 3628442707863 |
11 | 11798a5351706 |
12 | 4a7272155873 |
13 | 20421202095c |
14 | c789084b131 |
15 | 645b66259e3 |
hex | 34cd009e797 |
3628442707863 has 8 divisors (see below), whose sum is σ = 4838034815088. Its totient is φ = 2418906202944.
The previous prime is 3628442707829. The next prime is 3628442707889. The reversal of 3628442707863 is 3687072448263.
It is a happy number.
3628442707863 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3628442707863 - 214 = 3628442691479 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3628442707797 and 3628442707806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3628442707163) 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, 13748070 + ... + 14009507.
It is an arithmetic number, because the mean of its divisors is an integer number (604754351886).
Almost surely, 23628442707863 is an apocalyptic number.
3628442707863 is a deficient number, since it is larger than the sum of its proper divisors (1209592107225).
3628442707863 is a wasteful number, since it uses less digits than its factorization.
3628442707863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27801153.
The product of its (nonzero) digits is 65028096, while the sum is 60.
The spelling of 3628442707863 in words is "three trillion, six hundred twenty-eight billion, four hundred forty-two million, seven hundred seven thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •