Base | Representation |
---|---|
bin | 101111000101000000… |
… | …1111110010100011101 |
3 | 100122221211112012102000 |
4 | 1132022001332110131 |
5 | 3124023101133041 |
6 | 114240020152513 |
7 | 10206231666606 |
oct | 1361201762435 |
9 | 318854465360 |
10 | 101100021021 |
11 | 3997036518a |
12 | 17716238739 |
13 | 96c2699b5c |
14 | 4c711a6dad |
15 | 296aac6bb6 |
hex | 178a07e51d |
101100021021 has 16 divisors (see below), whose sum is σ = 149790136320. Its totient is φ = 67394466720.
The previous prime is 101100020999. The next prime is 101100021049. The reversal of 101100021021 is 120120001101.
It is a happy number.
It is not a de Polignac number, because 101100021021 - 213 = 101100012829 is a prime.
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 = 101100020994 and 101100021012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100021091) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 194361 + ... + 489873.
It is an arithmetic number, because the mean of its divisors is an integer number (9361883520).
Almost surely, 2101100021021 is an apocalyptic number.
It is an amenable number.
101100021021 is a deficient number, since it is larger than the sum of its proper divisors (48690115299).
101100021021 is a wasteful number, since it uses less digits than its factorization.
101100021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308193 (or 308187 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101100021021 its reverse (120120001101), we get a palindrome (221220022122).
The spelling of 101100021021 in words is "one hundred one billion, one hundred million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •