Base | Representation |
---|---|
bin | 10110111111001101010001… |
… | …111110101001000010010111 |
3 | 111020222010100101020202110200 |
4 | 112333031101332221002113 |
5 | 101222413022300243210 |
6 | 555004551310351543 |
7 | 30203164243412505 |
oct | 2677152176510227 |
9 | 436863311222420 |
10 | 101100610556055 |
11 | 2a239589a75a50 |
12 | b409b85abb5b3 |
13 | 4454992574796 |
14 | 1ad741d40d675 |
15 | ba4cd3b760c0 |
hex | 5bf351fa9097 |
101100610556055 has 48 divisors (see below), whose sum is σ = 191209457795616. Its totient is φ = 49008889589760.
The previous prime is 101100610556053. The next prime is 101100610556069. The reversal of 101100610556055 is 550655016001101.
It is a happy number.
It is not a de Polignac number, because 101100610556055 - 21 = 101100610556053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100610556053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 17442042 + ... + 22503911.
It is an arithmetic number, because the mean of its divisors is an integer number (3983530370742).
Almost surely, 2101100610556055 is an apocalyptic number.
101100610556055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
101100610556055 is a deficient number, since it is larger than the sum of its proper divisors (90108847239561).
101100610556055 is a wasteful number, since it uses less digits than its factorization.
101100610556055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39951088 (or 39951085 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
Adding to 101100610556055 its reverse (550655016001101), we get a palindrome (651755626557156).
The spelling of 101100610556055 in words is "one hundred one trillion, one hundred billion, six hundred ten million, five hundred fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •