Base | Representation |
---|---|
bin | 101111000010111011… |
… | …1110000000011101100 |
3 | 100122202222012120021120 |
4 | 1132011313300003230 |
5 | 3123402214413200 |
6 | 114225044300540 |
7 | 10204423543134 |
oct | 1360567600354 |
9 | 318688176246 |
10 | 101030232300 |
11 | 39934a28958 |
12 | 176b69a1750 |
13 | 96b10a355a |
14 | 4c65bdbac4 |
15 | 29648dd9a0 |
hex | 1785df00ec |
101030232300 has 72 divisors (see below), whose sum is σ = 296014387200. Its totient is φ = 26600358720.
The previous prime is 101030232271. The next prime is 101030232307. The reversal of 101030232300 is 3232030101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101030232300.
It is not an unprimeable number, because it can be changed into a prime (101030232307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2107740 + ... + 2155139.
Almost surely, 2101030232300 is an apocalyptic number.
101030232300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101030232300 is an abundant number, since it is smaller than the sum of its proper divisors (194984154900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101030232300 is a wasteful number, since it uses less digits than its factorization.
101030232300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4262975 (or 4262968 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 101030232300 its reverse (3232030101), we get a palindrome (104262262401).
The spelling of 101030232300 in words is "one hundred one billion, thirty million, two hundred thirty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •