Base | Representation |
---|---|
bin | 101110100100001110… |
… | …1101110100001100000 |
3 | 100120010011122100101021 |
4 | 1131020131232201200 |
5 | 3114300000000341 |
6 | 113534523015224 |
7 | 10140043655533 |
oct | 1351035564140 |
9 | 316104570337 |
10 | 100000000096 |
11 | 39456436187 |
12 | 1746996a514 |
13 | 957880c7b9 |
14 | 4ba9060a1a |
15 | 29042399d1 |
hex | 174876e860 |
100000000096 has 24 divisors (see below), whose sum is σ = 198312052680. Its totient is φ = 49635034368.
The previous prime is 100000000091. The next prime is 100000000103. The reversal of 100000000096 is 690000000001.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 99999999998 and 100000000079.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000000091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11400726 + ... + 11409493.
It is an arithmetic number, because the mean of its divisors is an integer number (8263002195).
Almost surely, 2100000000096 is an apocalyptic number.
100000000096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
100000000096 is a deficient number, since it is larger than the sum of its proper divisors (98312052584).
100000000096 is a wasteful number, since it uses less digits than its factorization.
100000000096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22810366 (or 22810358 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 100000000096 its reverse (690000000001), we get a palindrome (790000000097).
The spelling of 100000000096 in words is "one hundred billion, ninety-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •