Base | Representation |
---|---|
bin | 10111111000000110001100… |
… | …000010111101011100010000 |
3 | 111202210212011210121121220020 |
4 | 113320012030002331130100 |
5 | 102230440442240143341 |
6 | 1011200532541143440 |
7 | 31055502550066401 |
oct | 2770061402753420 |
9 | 452725153547806 |
10 | 105010005006096 |
11 | 30506547247913 |
12 | b93b78625ab80 |
13 | 4679529c5b158 |
14 | 1bd07232619a8 |
15 | c2184053c566 |
hex | 5f818c0bd710 |
105010005006096 has 80 divisors (see below), whose sum is σ = 279038243516544. Its totient is φ = 34004659756032.
The previous prime is 105010005006031. The next prime is 105010005006097. The reversal of 105010005006096 is 690600500010501.
It is a super-2 number, since 2×1050100050060962 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105010005006097) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44544325 + ... + 46842468.
Almost surely, 2105010005006096 is an apocalyptic number.
105010005006096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
105010005006096 is an abundant number, since it is smaller than the sum of its proper divisors (174028238510448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105010005006096 is a wasteful number, since it uses less digits than its factorization.
105010005006096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91387488 (or 91387482 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 33.
Adding to 105010005006096 its reverse (690600500010501), we get a palindrome (795610505016597).
The spelling of 105010005006096 in words is "one hundred five trillion, ten billion, five million, six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •