Base | Representation |
---|---|
bin | 101110101011100000… |
… | …1011001011111000100 |
3 | 100120202012012121202020 |
4 | 1131113001121133010 |
5 | 3120300010412012 |
6 | 114015045443140 |
7 | 10146100625352 |
oct | 1352701313704 |
9 | 316665177666 |
10 | 100244232132 |
11 | 3957128a340 |
12 | 175177104b0 |
13 | 95b72b29b5 |
14 | 4bcd6787d2 |
15 | 291a8cea8c |
hex | 17570597c4 |
100244232132 has 24 divisors (see below), whose sum is σ = 255167136672. Its totient is φ = 30377040000.
The previous prime is 100244232131. The next prime is 100244232157. The reversal of 100244232132 is 231232442001.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (100244232131) 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 7 ways as a sum of consecutive naturals, for example, 379712869 + ... + 379713132.
It is an arithmetic number, because the mean of its divisors is an integer number (10631964028).
Almost surely, 2100244232132 is an apocalyptic number.
100244232132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100244232132 is an abundant number, since it is smaller than the sum of its proper divisors (154922904540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100244232132 is a wasteful number, since it uses less digits than its factorization.
100244232132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759426019 (or 759426017 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 100244232132 its reverse (231232442001), we get a palindrome (331476674133).
The spelling of 100244232132 in words is "one hundred billion, two hundred forty-four million, two hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •