Base | Representation |
---|---|
bin | 10110111111001110110001… |
… | …111010001100001110100010 |
3 | 111020222021111112201002112112 |
4 | 112333032301322030032202 |
5 | 101222424321310032320 |
6 | 555005415122355322 |
7 | 30203252155444400 |
oct | 2677166172141642 |
9 | 436867445632475 |
10 | 101102220002210 |
11 | 2a23a235509739 |
12 | b40a354abbb42 |
13 | 4454b8ab36c9b |
14 | 1ad7533082470 |
15 | ba4d7a0ddec5 |
hex | 5bf3b1e8c3a2 |
101102220002210 has 96 divisors (see below), whose sum is σ = 216223848792000. Its totient is φ = 33927293183616.
The previous prime is 101102220002153. The next prime is 101102220002213. The reversal of 101102220002210 is 12200022201101.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (101102220002213) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1015280 + ... + 14256059.
It is an arithmetic number, because the mean of its divisors is an integer number (2252331758250).
Almost surely, 2101102220002210 is an apocalyptic number.
101102220002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101102220002210 is an abundant number, since it is smaller than the sum of its proper divisors (115121628789790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102220002210 is a wasteful number, since it uses less digits than its factorization.
101102220002210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15271648 (or 15271641 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101102220002210 its reverse (12200022201101), we get a palindrome (113302242203311).
The spelling of 101102220002210 in words is "one hundred one trillion, one hundred two billion, two hundred twenty million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •