Base | Representation |
---|---|
bin | 1001000110010111100011… |
… | …00110010010010010100010 |
3 | 2121211221100001221111221200 |
4 | 10203023301212102102202 |
5 | 10110321000304311320 |
6 | 110320245552502030 |
7 | 4133450504141364 |
oct | 443136146222242 |
9 | 77757301844850 |
10 | 20010011010210 |
11 | 641521a6121a1 |
12 | 22b20a824a916 |
13 | b21c22357810 |
14 | 4d26bda48d34 |
15 | 24a78dbbb290 |
hex | 1232f19924a2 |
20010011010210 has 48 divisors (see below), whose sum is σ = 56028030831864. Its totient is φ = 4925541171456.
The previous prime is 20010011010181. The next prime is 20010011010229. The reversal of 20010011010210 is 1201011001002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 12305172984129 + 7704838026081 = 3507873^2 + 2775759^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20010011010192 and 20010011010201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8551285587 + ... + 8551287926.
Almost surely, 220010011010210 is an apocalyptic number.
20010011010210 is an abundant number, since it is smaller than the sum of its proper divisors (36018019821654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010011010210 is a wasteful number, since it uses less digits than its factorization.
20010011010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17102573539 (or 17102573536 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20010011010210 its reverse (1201011001002), we get a palindrome (21211022011212).
The spelling of 20010011010210 in words is "twenty trillion, ten billion, eleven million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •