Base | Representation |
---|---|
bin | 1100000100011… |
… | …01101010110000 |
3 | 21001111201001210 |
4 | 12002031222300 |
5 | 201404243233 |
6 | 14014000120 |
7 | 2336361516 |
oct | 602155260 |
9 | 231451053 |
10 | 101243568 |
11 | 52170878 |
12 | 29aa6040 |
13 | 17c8a84a |
14 | d6364b6 |
15 | 8d4d163 |
hex | 608dab0 |
101243568 has 80 divisors (see below), whose sum is σ = 282276576. Its totient is φ = 31150080.
The previous prime is 101243567. The next prime is 101243573. The reversal of 101243568 is 865342101.
It is a super-2 number, since 2×1012435682 = 20500520122741248, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101243567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42078 + ... + 44418.
Almost surely, 2101243568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101243568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141138288).
101243568 is an abundant number, since it is smaller than the sum of its proper divisors (181033008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101243568 is a wasteful number, since it uses less digits than its factorization.
101243568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2422 (or 2416 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 101243568 is about 10061.9862850234. The cubic root of 101243568 is about 466.0750061930.
Adding to 101243568 its reverse (865342101), we get a palindrome (966585669).
The spelling of 101243568 in words is "one hundred one million, two hundred forty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •