Base | Representation |
---|---|
bin | 10111001101110000111110… |
… | …011100100000011111001001 |
3 | 111101111202112221201021012010 |
4 | 113031300332130200133021 |
5 | 101340310332104033001 |
6 | 1001052320115210133 |
7 | 30335361133306461 |
oct | 2715607634403711 |
9 | 441452487637163 |
10 | 102101010221001 |
11 | 2a594882558050 |
12 | b54ba398a6949 |
13 | 44c811259524c |
14 | 1b2da02970ba1 |
15 | bc0d355368d6 |
hex | 5cdc3e7207c9 |
102101010221001 has 32 divisors (see below), whose sum is σ = 154707656970240. Its totient is φ = 59333902401600.
The previous prime is 102101010220919. The next prime is 102101010221011. The reversal of 102101010221001 is 100122010101201.
It is not a de Polignac number, because 102101010221001 - 229 = 102100473350089 is a prime.
It is a super-2 number, since 2×1021010102210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102101010221011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 457711815 + ... + 457934828.
It is an arithmetic number, because the mean of its divisors is an integer number (4834614280320).
Almost surely, 2102101010221001 is an apocalyptic number.
102101010221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102101010221001 is a deficient number, since it is larger than the sum of its proper divisors (52606646749239).
102101010221001 is a wasteful number, since it uses less digits than its factorization.
102101010221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915646797.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102101010221001 its reverse (100122010101201), we get a palindrome (202223020322202).
The spelling of 102101010221001 in words is "one hundred two trillion, one hundred one billion, ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •