Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100101000110010011100 |
3 | 111020222011100112020200200222 |
4 | 112333031221030220302130 |
5 | 101222414322011213040 |
6 | 555005054103540512 |
7 | 30203210013451223 |
oct | 2677155114506234 |
9 | 436864315220628 |
10 | 101101000101020 |
11 | 2a23976994a937 |
12 | b40a07445a738 |
13 | 4454a2519536a |
14 | 1ad7459051cba |
15 | ba4d07e71bb5 |
hex | 5bf369328c9c |
101101000101020 has 12 divisors (see below), whose sum is σ = 212312100212184. Its totient is φ = 40440400040400.
The previous prime is 101101000101007. The next prime is 101101000101037. The reversal of 101101000101020 is 20101000101101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101101000100989 and 101101000101007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2527525002506 + ... + 2527525002545.
It is an arithmetic number, because the mean of its divisors is an integer number (17692675017682).
Almost surely, 2101101000101020 is an apocalyptic number.
101101000101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101101000101020 is an abundant number, since it is smaller than the sum of its proper divisors (111211100111164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101000101020 is a wasteful number, since it uses less digits than its factorization.
101101000101020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5055050005060 (or 5055050005058 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 101101000101020 its reverse (20101000101101), we get a palindrome (121202000202121).
The spelling of 101101000101020 in words is "one hundred one trillion, one hundred one billion, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •