Base | Representation |
---|---|
bin | 101111110001100000001100… |
… | …100000101000001011111001 |
3 | 1000112221022122212002100100201 |
4 | 233301200030200220023321 |
5 | 210014420300030000441 |
6 | 2022511112302402201 |
7 | 62153642626362340 |
oct | 5761401440501371 |
9 | 1015838585070321 |
10 | 210110010000121 |
11 | 60a471780a7740 |
12 | 1b694889290361 |
13 | 903139aa05c1a |
14 | 39c55433bab57 |
15 | 194569be02c31 |
hex | bf180c8282f9 |
210110010000121 has 8 divisors (see below), whose sum is σ = 261955337143104. Its totient is φ = 163722085714320.
The previous prime is 210110010000113. The next prime is 210110010000161. The reversal of 210110010000121 is 121000010011012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210110010000121 - 23 = 210110010000113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210110010000098 and 210110010000107.
It is not an unprimeable number, because it can be changed into a prime (210110010000161) 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, 1364350714210 + ... + 1364350714363.
It is an arithmetic number, because the mean of its divisors is an integer number (32744417142888).
Almost surely, 2210110010000121 is an apocalyptic number.
It is an amenable number.
210110010000121 is a deficient number, since it is larger than the sum of its proper divisors (51845327142983).
210110010000121 is a wasteful number, since it uses less digits than its factorization.
210110010000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2728701428591.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 210110010000121 its reverse (121000010011012), we get a palindrome (331110020011133).
The spelling of 210110010000121 in words is "two hundred ten trillion, one hundred ten billion, ten million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •