Base | Representation |
---|---|
bin | 10110101111011110111000… |
… | …100101010110011110110110 |
3 | 111010010211002210021000211201 |
4 | 112233132320211112132312 |
5 | 101102211430024033420 |
6 | 552420315340523114 |
7 | 30032130563206624 |
oct | 2657367045263666 |
9 | 433124083230751 |
10 | 100020000221110 |
11 | 29962275677332 |
12 | b27466785049a |
13 | 43a6acb89a3c8 |
14 | 1a9adcb154514 |
15 | b86b3a58110a |
hex | 5af7b89567b6 |
100020000221110 has 16 divisors (see below), whose sum is σ = 184222884128976. Its totient is φ = 39077581481568.
The previous prime is 100020000220967. The next prime is 100020000221131. The reversal of 100020000221110 is 11122000020001.
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 (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116302325409 + ... + 116302326268.
It is an arithmetic number, because the mean of its divisors is an integer number (11513930258061).
Almost surely, 2100020000221110 is an apocalyptic number.
100020000221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100020000221110 is a deficient number, since it is larger than the sum of its proper divisors (84202883907866).
100020000221110 is a wasteful number, since it uses less digits than its factorization.
100020000221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232604651727.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100020000221110 its reverse (11122000020001), we get a palindrome (111142000241111).
The spelling of 100020000221110 in words is "one hundred trillion, twenty billion, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •