Base | Representation |
---|---|
bin | 10110110000101110000011… |
… | …000001100101110001111000 |
3 | 111010102221111122012222220201 |
4 | 112300232003001211301320 |
5 | 101110110020224000211 |
6 | 552523334054331544 |
7 | 30041230150001653 |
oct | 2660560301456170 |
9 | 433387448188821 |
10 | 100105001000056 |
11 | 29995324372678 |
12 | b28902a359bb4 |
13 | 43b1b26a74500 |
14 | 1aa117211489a |
15 | b88e62aac0c1 |
hex | 5b0b83065c78 |
100105001000056 has 48 divisors (see below), whose sum is σ = 203280306449760. Its totient is φ = 46194448285440.
The previous prime is 100105001000029. The next prime is 100105001000077. The reversal of 100105001000056 is 650000100501001.
It is a super-2 number, since 2×1001050010000562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100105000999997 and 100105001000042.
It is a congruent number.
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, 1656081 + ... + 14246143.
It is an arithmetic number, because the mean of its divisors is an integer number (4235006384370).
Almost surely, 2100105001000056 is an apocalyptic number.
It is an amenable number.
100105001000056 is an abundant number, since it is smaller than the sum of its proper divisors (103175305449704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100105001000056 is a wasteful number, since it uses less digits than its factorization.
100105001000056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12595976 (or 12595959 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 100105001000056 its reverse (650000100501001), we get a palindrome (750105101501057).
The spelling of 100105001000056 in words is "one hundred trillion, one hundred five billion, one million, fifty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •