Base | Representation |
---|---|
bin | 10110111111010001011101… |
… | …100100101110000111011101 |
3 | 111020222112221021000221020120 |
4 | 112333101131210232013131 |
5 | 101223001221103230010 |
6 | 555011013004105153 |
7 | 30203413426465644 |
oct | 2677213544560735 |
9 | 436875837027216 |
10 | 101105100055005 |
11 | 2a2404831a3a62 |
12 | b40aa195351b9 |
13 | 4455229712637 |
14 | 1ad772778435b |
15 | ba4e97d8ce70 |
hex | 5bf45d92e1dd |
101105100055005 has 48 divisors (see below), whose sum is σ = 179054850179520. Its totient is φ = 48544238938624.
The previous prime is 101105100054989. The next prime is 101105100055007. The reversal of 101105100055005 is 500550001501101.
It is not a de Polignac number, because 101105100055005 - 24 = 101105100054989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101105100055007) 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, 374619915 + ... + 374889704.
It is an arithmetic number, because the mean of its divisors is an integer number (3730309378740).
Almost surely, 2101105100055005 is an apocalyptic number.
101105100055005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101105100055005 is a deficient number, since it is larger than the sum of its proper divisors (77949750124515).
101105100055005 is a wasteful number, since it uses less digits than its factorization.
101105100055005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 749509690 (or 749509667 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 24.
Adding to 101105100055005 its reverse (500550001501101), we get a palindrome (601655101556106).
The spelling of 101105100055005 in words is "one hundred one trillion, one hundred five billion, one hundred million, fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •