Base | Representation |
---|---|
bin | 101111000011101000… |
… | …0111101001111111110 |
3 | 100122211121012122021010 |
4 | 1132013100331033332 |
5 | 3123424211222100 |
6 | 114231241420050 |
7 | 10205126400423 |
oct | 1360720751776 |
9 | 318747178233 |
10 | 101053617150 |
11 | 39947150282 |
12 | 1770279a626 |
13 | 96b5ba0545 |
14 | 4c68d67d4a |
15 | 29669ac750 |
hex | 178743d3fe |
101053617150 has 48 divisors (see below), whose sum is σ = 250719024384. Its totient is φ = 26936227680.
The previous prime is 101053617139. The next prime is 101053617179. The reversal of 101053617150 is 51716350101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 216097 + ... + 498803.
It is an arithmetic number, because the mean of its divisors is an integer number (5223313008).
Almost surely, 2101053617150 is an apocalyptic number.
101053617150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101053617150 is an abundant number, since it is smaller than the sum of its proper divisors (149665407234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101053617150 is a wasteful number, since it uses less digits than its factorization.
101053617150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285105 (or 285100 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 30.
Adding to 101053617150 its reverse (51716350101), we get a palindrome (152769967251).
The spelling of 101053617150 in words is "one hundred one billion, fifty-three million, six hundred seventeen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •