Base | Representation |
---|---|
bin | 101111001101010001… |
… | …1111110100110101100 |
3 | 100200200011102000102102 |
4 | 1132122203332212230 |
5 | 3130110101324130 |
6 | 114323324514232 |
7 | 10216140301025 |
oct | 1363243764654 |
9 | 320604360372 |
10 | 101377370540 |
11 | 39aa2978a66 |
12 | 177930ab978 |
13 | 9737c96cb4 |
14 | 4c99d61c4c |
15 | 298510e645 |
hex | 179a8fe9ac |
101377370540 has 24 divisors (see below), whose sum is σ = 213251512320. Its totient is φ = 40482560768.
The previous prime is 101377370537. The next prime is 101377370543. The reversal of 101377370540 is 45073773101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (101377370537) and next prime (101377370543).
It is a junction number, because it is equal to n+sod(n) for n = 101377370494 and 101377370503.
It is not an unprimeable number, because it can be changed into a prime (101377370543) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4262060 + ... + 4285779.
It is an arithmetic number, because the mean of its divisors is an integer number (8885479680).
Almost surely, 2101377370540 is an apocalyptic number.
101377370540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101377370540 is an abundant number, since it is smaller than the sum of its proper divisors (111874141780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101377370540 is a wasteful number, since it uses less digits than its factorization.
101377370540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8548441 (or 8548439 counting only the distinct ones).
The product of its (nonzero) digits is 61740, while the sum is 38.
The spelling of 101377370540 in words is "one hundred one billion, three hundred seventy-seven million, three hundred seventy thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •