Base | Representation |
---|---|
bin | 101111110001100000010010… |
… | …000000011010110011101100 |
3 | 1000112221022220021121121021020 |
4 | 233301200102000122303230 |
5 | 210014420442132020022 |
6 | 2022511125355134140 |
7 | 62153645126262111 |
oct | 5761402200326354 |
9 | 1015838807547236 |
10 | 210110102220012 |
11 | 60a47215164925 |
12 | 1b6948b4144350 |
13 | 90313b3b543c7 |
14 | 39c5551744908 |
15 | 19456a506c35c |
hex | bf181201acec |
210110102220012 has 12 divisors (see below), whose sum is σ = 490256905180056. Its totient is φ = 70036700740000.
The previous prime is 210110102220001. The next prime is 210110102220041. The reversal of 210110102220012 is 210022201011012.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 210110102219973 and 210110102220000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8754587592489 + ... + 8754587592512.
It is an arithmetic number, because the mean of its divisors is an integer number (40854742098338).
Almost surely, 2210110102220012 is an apocalyptic number.
It is an amenable number.
210110102220012 is an abundant number, since it is smaller than the sum of its proper divisors (280146802960044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210110102220012 is a wasteful number, since it uses less digits than its factorization.
210110102220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17509175185008 (or 17509175185006 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210110102220012 its reverse (210022201011012), we get a palindrome (420132303231024).
The spelling of 210110102220012 in words is "two hundred ten trillion, one hundred ten billion, one hundred two million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •