Base | Representation |
---|---|
bin | 101111110000100000110111… |
… | …111111110100101000001101 |
3 | 1000112200211011112010122002022 |
4 | 233300200313333310220031 |
5 | 210012312024122333401 |
6 | 2022415545535335525 |
7 | 62146015031056610 |
oct | 5760406777645015 |
9 | 1015624145118068 |
10 | 210042020121101 |
11 | 60a20358635283 |
12 | 1b6836736815a5 |
13 | 9027b53b6a58c |
14 | 39c2133736177 |
15 | 1943a1d00371b |
hex | bf0837ff4a0d |
210042020121101 has 64 divisors (see below), whose sum is σ = 250305181862400. Its totient is φ = 172553389572096.
The previous prime is 210042020121079. The next prime is 210042020121133. The reversal of 210042020121101 is 101121020240012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210042020121101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210042020121101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210042020121161) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3312463685 + ... + 3312527093.
It is an arithmetic number, because the mean of its divisors is an integer number (3911018466600).
Almost surely, 2210042020121101 is an apocalyptic number.
It is an amenable number.
210042020121101 is a deficient number, since it is larger than the sum of its proper divisors (40263161741299).
210042020121101 is a wasteful number, since it uses less digits than its factorization.
210042020121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64758.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210042020121101 its reverse (101121020240012), we get a palindrome (311163040361113).
The spelling of 210042020121101 in words is "two hundred ten trillion, forty-two billion, twenty million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •