Base | Representation |
---|---|
bin | 101111000101101011… |
… | …0101111011001011100 |
3 | 100200000101100011001102 |
4 | 1132023112233121130 |
5 | 3124044243222030 |
6 | 114242132332232 |
7 | 10206621606323 |
oct | 1361326573134 |
9 | 320011304042 |
10 | 101122242140 |
11 | 39981962247 |
12 | 17721774078 |
13 | 96c717a24a |
14 | 4c7410d0ba |
15 | 296ca15c45 |
hex | 178b5af65c |
101122242140 has 12 divisors (see below), whose sum is σ = 212356708536. Its totient is φ = 40448896848.
The previous prime is 101122242139. The next prime is 101122242157. The reversal of 101122242140 is 41242221101.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 5056112107 = 101122242140 / (1 + 0 + 1 + 1 + 2 + 2 + 2 + 4 + 2 + 1 + 4 + 0).
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, 2528056034 + ... + 2528056073.
It is an arithmetic number, because the mean of its divisors is an integer number (17696392378).
Almost surely, 2101122242140 is an apocalyptic number.
101122242140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101122242140 is an abundant number, since it is smaller than the sum of its proper divisors (111234466396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101122242140 is a wasteful number, since it uses less digits than its factorization.
101122242140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5056112116 (or 5056112114 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 101122242140 its reverse (41242221101), we get a palindrome (142364463241).
The spelling of 101122242140 in words is "one hundred one billion, one hundred twenty-two million, two hundred forty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •