Base | Representation |
---|---|
bin | 10111110111111101111001… |
… | …010001011100010111000000 |
3 | 111202210000012012110120122110 |
4 | 113313331321101130113000 |
5 | 102230314223111213211 |
6 | 1011152501154135320 |
7 | 31055036100461205 |
oct | 2767757121342700 |
9 | 452700165416573 |
10 | 105001100101056 |
11 | 305027976a7965 |
12 | b939abbb81540 |
13 | 467873b0c4b83 |
14 | 1bd011a721cac |
15 | c214bd896ea6 |
hex | 5f7f7945c5c0 |
105001100101056 has 28 divisors (see below), whose sum is σ = 277815410684552. Its totient is φ = 35000366700288.
The previous prime is 105001100101043. The next prime is 105001100101057. The reversal of 105001100101056 is 650101001100501.
It is a happy number.
It is a super-2 number, since 2×1050011001010562 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105001100101057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 273440364655 + ... + 273440365038.
Almost surely, 2105001100101056 is an apocalyptic number.
105001100101056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
105001100101056 is an abundant number, since it is smaller than the sum of its proper divisors (172814310583496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105001100101056 is an equidigital number, since it uses as much as digits as its factorization.
105001100101056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546880729708 (or 546880729698 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 105001100101056 its reverse (650101001100501), we get a palindrome (755102101201557).
The spelling of 105001100101056 in words is "one hundred five trillion, one billion, one hundred million, one hundred one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •