Base | Representation |
---|---|
bin | 10111000010000111001011… |
… | …111000000010111100100100 |
3 | 111021200012120210102122002122 |
4 | 113002013023320002330210 |
5 | 101234200324340040030 |
6 | 555240402554325112 |
7 | 30223461663044321 |
oct | 2702071370027444 |
9 | 437605523378078 |
10 | 101300224143140 |
11 | 2a306202701430 |
12 | b4407b4129798 |
13 | 446a7547cb859 |
14 | 1b02d58065b48 |
15 | baa0b821c8e5 |
hex | 5c21cbe02f24 |
101300224143140 has 48 divisors (see below), whose sum is σ = 232085449471680. Its totient is φ = 36833930052480.
The previous prime is 101300224143119. The next prime is 101300224143187. The reversal of 101300224143140 is 41341422003101.
It is a super-2 number, since 2×1013002241431402 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12488330 + ... + 18935649.
It is an arithmetic number, because the mean of its divisors is an integer number (4835113530660).
Almost surely, 2101300224143140 is an apocalyptic number.
101300224143140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101300224143140 is an abundant number, since it is smaller than the sum of its proper divisors (130785225328540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101300224143140 is a wasteful number, since it uses less digits than its factorization.
101300224143140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31438652 (or 31438650 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 101300224143140 its reverse (41341422003101), we get a palindrome (142641646146241).
The spelling of 101300224143140 in words is "one hundred one trillion, three hundred billion, two hundred twenty-four million, one hundred forty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •