Base | Representation |
---|---|
bin | 101111010001110110… |
… | …1011101000011011100 |
3 | 100201001212012112222100 |
4 | 1132203231131003130 |
5 | 3130413344141000 |
6 | 114350450245100 |
7 | 10223012660403 |
oct | 1364355350334 |
9 | 321055175870 |
10 | 101530849500 |
11 | 3a071576a83 |
12 | 17816586790 |
13 | 9760a13552 |
14 | 4cb24b463a |
15 | 2993829a00 |
hex | 17a3b5d0dc |
101530849500 has 72 divisors (see below), whose sum is σ = 320296000752. Its totient is φ = 27074892000.
The previous prime is 101530849477. The next prime is 101530849517. The reversal of 101530849500 is 5948035101.
101530849500 is a `hidden beast` number, since 10 + 153 + 0 + 8 + 495 + 0 + 0 = 666.
101530849500 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11276706 + ... + 11285705.
It is an arithmetic number, because the mean of its divisors is an integer number (4448555566).
Almost surely, 2101530849500 is an apocalyptic number.
101530849500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101530849500 is an abundant number, since it is smaller than the sum of its proper divisors (218765151252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101530849500 is a wasteful number, since it uses less digits than its factorization.
101530849500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22562436 (or 22562421 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 101530849500 in words is "one hundred one billion, five hundred thirty million, eight hundred forty-nine thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •