Base | Representation |
---|---|
bin | 10110111111010110111110… |
… | …011011111100010011111110 |
3 | 111021000010012211122221111111 |
4 | 112333112332123330103332 |
5 | 101223100332122023402 |
6 | 555013432243312234 |
7 | 30204013223233501 |
oct | 2677267633742376 |
9 | 437003184587444 |
10 | 101111020111102 |
11 | 2a242a40991801 |
12 | b40bbb007b67a |
13 | 445596106a701 |
14 | 1ad7b29b03138 |
15 | ba51e29839d7 |
hex | 5bf5be6fc4fe |
101111020111102 has 16 divisors (see below), whose sum is σ = 154674081820080. Its totient is φ = 49557847643392.
The previous prime is 101111020111099. The next prime is 101111020111111. The reversal of 101111020111102 is 201111020111101.
It is a super-3 number, since 3×1011110201111023 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1213659553 + ... + 1213742860.
It is an arithmetic number, because the mean of its divisors is an integer number (9667130113755).
Almost surely, 2101111020111102 is an apocalyptic number.
101111020111102 is a deficient number, since it is larger than the sum of its proper divisors (53563061708978).
101111020111102 is a wasteful number, since it uses less digits than its factorization.
101111020111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2427402827.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101111020111102 its reverse (201111020111101), we get a palindrome (302222040222203).
Subtracting 101111020111102 from its reverse (201111020111101), we obtain a palindrome (99999999999999).
The spelling of 101111020111102 in words is "one hundred one trillion, one hundred eleven billion, twenty million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •