Base | Representation |
---|---|
bin | 10110111111100001100000… |
… | …100111111111011010001100 |
3 | 111021001012102010022101021102 |
4 | 112333201200213333122030 |
5 | 101223242013231104400 |
6 | 555022542501322232 |
7 | 30204563430200633 |
oct | 2677414047773214 |
9 | 437035363271242 |
10 | 101122331113100 |
11 | 2a247815728a40 |
12 | b412228106378 |
13 | 4456a445457bb |
14 | 1ad84c000c51a |
15 | ba56559a69d5 |
hex | 5bf8609ff68c |
101122331113100 has 36 divisors (see below), whose sum is σ = 239384136564888. Its totient is φ = 36771756768000.
The previous prime is 101122331113049. The next prime is 101122331113127. The reversal of 101122331113100 is 1311133221101.
It is a super-2 number, since 2×1011223311131002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45964694861 + ... + 45964697060.
Almost surely, 2101122331113100 is an apocalyptic number.
101122331113100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101122331113100 is an abundant number, since it is smaller than the sum of its proper divisors (138261805451788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101122331113100 is a wasteful number, since it uses less digits than its factorization.
101122331113100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91929391946 (or 91929391939 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 101122331113100 its reverse (1311133221101), we get a palindrome (102433464334201).
The spelling of 101122331113100 in words is "one hundred one trillion, one hundred twenty-two billion, three hundred thirty-one million, one hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •