Base | Representation |
---|---|
bin | 101110101011001000… |
… | …0001010001100011000 |
3 | 100120201021220211201120 |
4 | 1131112100022030120 |
5 | 3120233204340230 |
6 | 114013505045240 |
7 | 10145553125532 |
oct | 1352620121430 |
9 | 316637824646 |
10 | 100231324440 |
11 | 39564a73625 |
12 | 17513326820 |
13 | 95b4713800 |
14 | 4bcba78852 |
15 | 29196d0310 |
hex | 175640a318 |
100231324440 has 96 divisors (see below), whose sum is σ = 325603599120. Its totient is φ = 24672321024.
The previous prime is 100231324421. The next prime is 100231324469. The reversal of 100231324440 is 44423132001.
100231324440 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 (24).
It is a self number, because there is not a number n which added to its sum of digits gives 100231324440.
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, 2450907 + ... + 2491466.
Almost surely, 2100231324440 is an apocalyptic number.
100231324440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100231324440 is an abundant number, since it is smaller than the sum of its proper divisors (225372274680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100231324440 is a wasteful number, since it uses less digits than its factorization.
100231324440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4942413 (or 4942396 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 100231324440 its reverse (44423132001), we get a palindrome (144654456441).
The spelling of 100231324440 in words is "one hundred billion, two hundred thirty-one million, three hundred twenty-four thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •