Base | Representation |
---|---|
bin | 1100000011010… |
… | …11000001010010 |
3 | 21001020111101120 |
4 | 12001223001102 |
5 | 201340223100 |
6 | 14010543110 |
7 | 2335230666 |
oct | 601530122 |
9 | 231214346 |
10 | 101101650 |
11 | 52084191 |
12 | 29a37a96 |
13 | 17c3b080 |
14 | d5da8a6 |
15 | 8d210a0 |
hex | 606b052 |
101101650 has 96 divisors (see below), whose sum is σ = 272690880. Its totient is φ = 24641280.
The previous prime is 101101621. The next prime is 101101667. The reversal of 101101650 is 56101101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 270864 + ... + 271236.
It is an arithmetic number, because the mean of its divisors is an integer number (2840530).
Almost surely, 2101101650 is an apocalyptic number.
101101650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101101650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136345440).
101101650 is an abundant number, since it is smaller than the sum of its proper divisors (171589230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101650 is a wasteful number, since it uses less digits than its factorization.
101101650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540 (or 535 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 101101650 is about 10054.9316258242. The cubic root of 101101650 is about 465.8571310757.
Adding to 101101650 its reverse (56101101), we get a palindrome (157202751).
The spelling of 101101650 in words is "one hundred one million, one hundred one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •