Base | Representation |
---|---|
bin | 1001001001000001011010… |
… | …11111101100110011110001 |
3 | 2122011122201220100220100211 |
4 | 10210200231133230303301 |
5 | 10113314234304330001 |
6 | 110430211332344121 |
7 | 4143156504543505 |
oct | 444405537546361 |
9 | 78148656326324 |
10 | 20101210230001 |
11 | 644a96a15691a |
12 | 23078ba775041 |
13 | b2a6c775a0b4 |
14 | 4d6c91d12305 |
15 | 24cd2a47c351 |
hex | 12482d7eccf1 |
20101210230001 has 8 divisors (see below), whose sum is σ = 20134941883200. Its totient is φ = 20067490495728.
The previous prime is 20101210229999. The next prime is 20101210230041. The reversal of 20101210230001 is 10003201210102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20101210230001 - 21 = 20101210229999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101210230041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 399300 + ... + 6353098.
It is an arithmetic number, because the mean of its divisors is an integer number (2516867735400).
Almost surely, 220101210230001 is an apocalyptic number.
It is an amenable number.
20101210230001 is a deficient number, since it is larger than the sum of its proper divisors (33731653199).
20101210230001 is an equidigital number, since it uses as much as digits as its factorization.
20101210230001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5959463.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20101210230001 its reverse (10003201210102), we get a palindrome (30104411440103).
The spelling of 20101210230001 in words is "twenty trillion, one hundred one billion, two hundred ten million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •