Base | Representation |
---|---|
bin | 100110100100000110100… |
… | …010001101000000011111 |
3 | 100101100101100001202001112 |
4 | 212210012202031000133 |
5 | 321404403214413403 |
6 | 5345235143332235 |
7 | 362315026110014 |
oct | 46440642150037 |
9 | 10340340052045 |
10 | 2650104451103 |
11 | 9319a296905a |
12 | 36973675107b |
13 | 162b997a3085 |
14 | 923a129370b |
15 | 48e069739d8 |
hex | 2690688d01f |
2650104451103 has 16 divisors (see below), whose sum is σ = 2886610608000. Its totient is φ = 2423351058912.
The previous prime is 2650104451063. The next prime is 2650104451117. The reversal of 2650104451103 is 3011544010562.
It is a cyclic number.
It is not a de Polignac number, because 2650104451103 - 26 = 2650104451039 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2650104451103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2650104454103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1216688 + ... + 2603946.
It is an arithmetic number, because the mean of its divisors is an integer number (180413163000).
Almost surely, 22650104451103 is an apocalyptic number.
2650104451103 is a deficient number, since it is larger than the sum of its proper divisors (236506156897).
2650104451103 is a wasteful number, since it uses less digits than its factorization.
2650104451103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1390774.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 2650104451103 its reverse (3011544010562), we get a palindrome (5661648461665).
The spelling of 2650104451103 in words is "two trillion, six hundred fifty billion, one hundred four million, four hundred fifty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •