Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …110011010110010000111010 |
3 | 111010002212121100211222212001 |
4 | 112233111223303112100322 |
5 | 101102031212230010020 |
6 | 552412003230411214 |
7 | 30031331025514120 |
oct | 2657255363262072 |
9 | 433085540758761 |
10 | 100010122110010 |
11 | 29959066744252 |
12 | b27276b660b0a |
13 | 43a5bb6218858 |
14 | 1a9a73127d910 |
15 | b8675d24d50a |
hex | 5af56bcd643a |
100010122110010 has 16 divisors (see below), whose sum is σ = 205735108340736. Its totient is φ = 34289184723408.
The previous prime is 100010122110007. The next prime is 100010122110061. The reversal of 100010122110010 is 10011221010001.
It is a super-2 number, since 2×1000101221100102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 714358015002 + ... + 714358015141.
It is an arithmetic number, because the mean of its divisors is an integer number (12858444271296).
Almost surely, 2100010122110010 is an apocalyptic number.
100010122110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100010122110010 is an abundant number, since it is smaller than the sum of its proper divisors (105724986230726).
100010122110010 is a wasteful number, since it uses less digits than its factorization.
100010122110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1428716030157.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100010122110010 its reverse (10011221010001), we get a palindrome (110021343120011).
The spelling of 100010122110010 in words is "one hundred trillion, ten billion, one hundred twenty-two million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •