Base | Representation |
---|---|
bin | 100001100111011000100… |
… | …001100000011000101011 |
3 | 22011211120222011202021210 |
4 | 201213120201200120223 |
5 | 300321420201200021 |
6 | 4525114014004203 |
7 | 325615461605454 |
oct | 41473041403053 |
9 | 8154528152253 |
10 | 2310030100011 |
11 | 810750850737 |
12 | 3138484a6663 |
13 | 139ab138baaa |
14 | 7db3db4c12b |
15 | 40150ee2e76 |
hex | 219d886062b |
2310030100011 has 4 divisors (see below), whose sum is σ = 3080040133352. Its totient is φ = 1540020066672.
The previous prime is 2310030099989. The next prime is 2310030100051. The reversal of 2310030100011 is 1100010300132.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-2310030100011 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 2310030100011.
It is not an unprimeable number, because it can be changed into a prime (2310030100051) 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 3 ways as a sum of consecutive naturals, for example, 385005016666 + ... + 385005016671.
It is an arithmetic number, because the mean of its divisors is an integer number (770010033338).
Almost surely, 22310030100011 is an apocalyptic number.
2310030100011 is a deficient number, since it is larger than the sum of its proper divisors (770010033341).
2310030100011 is an equidigital number, since it uses as much as digits as its factorization.
2310030100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 770010033340.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 2310030100011 its reverse (1100010300132), we get a palindrome (3410040400143).
The spelling of 2310030100011 in words is "two trillion, three hundred ten billion, thirty million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •