Base | Representation |
---|---|
bin | 11110100011111000111… |
… | …010000001011000110011 |
3 | 21102202202222021211100010 |
4 | 132203320322001120303 |
5 | 233402021210000201 |
6 | 4244440512030003 |
7 | 304504634314653 |
oct | 36437072013063 |
9 | 7382688254303 |
10 | 2100120000051 |
11 | 73a723a98787 |
12 | 29b025b32303 |
13 | 12306ab9aa58 |
14 | 7390982a363 |
15 | 39967a1cbd6 |
hex | 1e8f8e81633 |
2100120000051 has 8 divisors (see below), whose sum is σ = 2835605063680. Its totient is φ = 1382357468232.
The previous prime is 2100120000029. The next prime is 2100120000089. The reversal of 2100120000051 is 1500000210012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2100120000051 - 221 = 2100117902899 is a prime.
It is a super-2 number, since 2×21001200000512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100119999991 and 2100120000036.
It is not an unprimeable number, because it can be changed into a prime (2100120001051) 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, 4430632675 + ... + 4430633148.
It is an arithmetic number, because the mean of its divisors is an integer number (354450632960).
Almost surely, 22100120000051 is an apocalyptic number.
2100120000051 is a deficient number, since it is larger than the sum of its proper divisors (735485063629).
2100120000051 is an equidigital number, since it uses as much as digits as its factorization.
2100120000051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8861265905.
The product of its (nonzero) digits is 20, while the sum is 12.
Adding to 2100120000051 its reverse (1500000210012), we get a palindrome (3600120210063).
The spelling of 2100120000051 in words is "two trillion, one hundred billion, one hundred twenty million, fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •