Base | Representation |
---|---|
bin | 10110110010000110100010… |
… | …101010001100110111001110 |
3 | 111010210000202202011010221201 |
4 | 112302012202222030313032 |
5 | 101113134120340120420 |
6 | 553035130523220114 |
7 | 30051132633564334 |
oct | 2662064252146716 |
9 | 433700682133851 |
10 | 100200021020110 |
11 | 29a21654725070 |
12 | b2a352837763a |
13 | 43baa8a91494b |
14 | 1aa59c7a05b54 |
15 | b8b6749e710a |
hex | 5b21a2a8cdce |
100200021020110 has 64 divisors (see below), whose sum is σ = 202420388124864. Its totient is φ = 35395113779200.
The previous prime is 100200021020089. The next prime is 100200021020153. The reversal of 100200021020110 is 11020120002001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46625779 + ... + 48727438.
It is an arithmetic number, because the mean of its divisors is an integer number (3162818564451).
Almost surely, 2100200021020110 is an apocalyptic number.
100200021020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100200021020110 is an abundant number, since it is smaller than the sum of its proper divisors (102220367104754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100200021020110 is a wasteful number, since it uses less digits than its factorization.
100200021020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95353509.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100200021020110 its reverse (11020120002001), we get a palindrome (111220141022111).
The spelling of 100200021020110 in words is "one hundred trillion, two hundred billion, twenty-one million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •