Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001001011001101000011101 |
3 | 111020222002001111110221001000 |
4 | 112333030310021121220131 |
5 | 101222411011133410221 |
6 | 555004425511140513 |
7 | 30203145655311510 |
oct | 2677146411315035 |
9 | 436862044427030 |
10 | 101100110060061 |
11 | 2a2393524aa9a2 |
12 | b409a66374739 |
13 | 44549129779c8 |
14 | 1ad73b2b68d77 |
15 | ba4ca4c60e26 |
hex | 5bf334259a1d |
101100110060061 has 16 divisors (see below), whose sum is σ = 171174789520000. Its totient is φ = 57771491462784.
The previous prime is 101100110060029. The next prime is 101100110060071. The reversal of 101100110060061 is 160060011001101.
101100110060061 is a `hidden beast` number, since 1 + 0 + 1 + 1 + 0 + 0 + 1 + 1 + 0 + 0 + 600 + 61 = 666.
It is not a de Polignac number, because 101100110060061 - 25 = 101100110060029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100110060011) 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, 267460608436 + ... + 267460608813.
It is an arithmetic number, because the mean of its divisors is an integer number (10698424345000).
Almost surely, 2101100110060061 is an apocalyptic number.
It is an amenable number.
101100110060061 is a deficient number, since it is larger than the sum of its proper divisors (70074679459939).
101100110060061 is an equidigital number, since it uses as much as digits as its factorization.
101100110060061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534921217265 (or 534921217259 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 101100110060061 its reverse (160060011001101), we get a palindrome (261160121061162).
The spelling of 101100110060061 in words is "one hundred one trillion, one hundred billion, one hundred ten million, sixty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •