Base | Representation |
---|---|
bin | 10110110000101010011011… |
… | …001010011010111111000110 |
3 | 111010102120110112111120102201 |
4 | 112300222123022122333012 |
5 | 101110024033404013110 |
6 | 552521452054225114 |
7 | 30041031563362636 |
oct | 2660523312327706 |
9 | 433376415446381 |
10 | 100101111001030 |
11 | 29993708590847 |
12 | b28832365519a |
13 | 43b1656b88739 |
14 | 1aa0cc36366c6 |
15 | b88cd6314b3a |
hex | 5b0a9b29afc6 |
100101111001030 has 32 divisors (see below), whose sum is σ = 189667389024000. Its totient is φ = 37932627375072.
The previous prime is 100101111000977. The next prime is 100101111001043. The reversal of 100101111001030 is 30100111101001.
It is a super-2 number, since 2×1001011110010302 (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 a junction number, because it is equal to n+sod(n) for n = 100101111000998 and 100101111001016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14306229 + ... + 20121391.
It is an arithmetic number, because the mean of its divisors is an integer number (5927105907000).
Almost surely, 2100101111001030 is an apocalyptic number.
100101111001030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100101111001030 is a deficient number, since it is larger than the sum of its proper divisors (89566278022970).
100101111001030 is a wasteful number, since it uses less digits than its factorization.
100101111001030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5905788.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 100101111001030 its reverse (30100111101001), we get a palindrome (130201222102031).
The spelling of 100101111001030 in words is "one hundred trillion, one hundred one billion, one hundred eleven million, one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •