Base | Representation |
---|---|
bin | 10110111110000011010000… |
… | …000101111001110001100010 |
3 | 111020200112011200112020200012 |
4 | 112332003100011321301202 |
5 | 101220112224213311320 |
6 | 554504243543124522 |
7 | 30164351402052053 |
oct | 2676032005716142 |
9 | 436615150466605 |
10 | 101021122010210 |
11 | 2a2088a9839a56 |
12 | b3b66a1443742 |
13 | 444a3353a547c |
14 | 1ad363c56c72a |
15 | ba2bd05344c5 |
hex | 5be0d0179c62 |
101021122010210 has 8 divisors (see below), whose sum is σ = 181838019618396. Its totient is φ = 40408448804080.
The previous prime is 101021122010197. The next prime is 101021122010213. The reversal of 101021122010210 is 12010221120101.
It can be written as a sum of positive squares in 2 ways, for example, as 95682300483289 + 5338821526921 = 9781733^2 + 2310589^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1010211220102102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101021122010213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5051056100501 + ... + 5051056100520.
Almost surely, 2101021122010210 is an apocalyptic number.
101021122010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101021122010210 is a deficient number, since it is larger than the sum of its proper divisors (80816897608186).
101021122010210 is a wasteful number, since it uses less digits than its factorization.
101021122010210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10102112201028.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101021122010210 its reverse (12010221120101), we get a palindrome (113031343130311).
The spelling of 101021122010210 in words is "one hundred one trillion, twenty-one billion, one hundred twenty-two million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •