Base | Representation |
---|---|
bin | 1011010111101001… |
… | …10010101110001011 |
3 | 120202101200201212000 |
4 | 11223310302232023 |
5 | 100000103444101 |
6 | 2445405122043 |
7 | 304155606654 |
oct | 55364625613 |
9 | 16671621760 |
10 | 6103968651 |
11 | 2652592aa0 |
12 | 1224259323 |
13 | 76379ba91 |
14 | 41c95452b |
15 | 25ad23486 |
hex | 16bd32b8b |
6103968651 has 16 divisors (see below), whose sum is σ = 9865000320. Its totient is φ = 3699374760.
The previous prime is 6103968623. The next prime is 6103968679. The reversal of 6103968651 is 1568693016.
It is an interprime number because it is at equal distance from previous prime (6103968623) and next prime (6103968679).
It is not a de Polignac number, because 6103968651 - 26 = 6103968587 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6103968597 and 6103968606.
It is not an unprimeable number, because it can be changed into a prime (6103968151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10275745 + ... + 10276338.
It is an arithmetic number, because the mean of its divisors is an integer number (616562520).
Almost surely, 26103968651 is an apocalyptic number.
6103968651 is a deficient number, since it is larger than the sum of its proper divisors (3761031669).
6103968651 is a wasteful number, since it uses less digits than its factorization.
6103968651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20552103 (or 20552097 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The square root of 6103968651 is about 78127.8993126015. The cubic root of 6103968651 is about 1827.5563001913.
The spelling of 6103968651 in words is "six billion, one hundred three million, nine hundred sixty-eight thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •