Base | Representation |
---|---|
bin | 101110101101110111… |
… | …0010111111110110001 |
3 | 100120221200200010002010 |
4 | 1131123232113332301 |
5 | 3120430210200223 |
6 | 114030544513133 |
7 | 10151046355206 |
oct | 1353356277661 |
9 | 316850603063 |
10 | 100323131313 |
11 | 39601879479 |
12 | 1753a01b7a9 |
13 | 95ca748cc2 |
14 | 4bd9d35cad |
15 | 29227b7393 |
hex | 175bb97fb1 |
100323131313 has 8 divisors (see below), whose sum is σ = 133765638048. Its totient is φ = 66881356064.
The previous prime is 100323131303. The next prime is 100323131369. The reversal of 100323131313 is 313131323001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100323131313 - 28 = 100323131057 is a prime.
It is a super-2 number, since 2×1003231313132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100323131313.
It is not an unprimeable number, because it can be changed into a prime (100323131303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 454981 + ... + 638477.
It is an arithmetic number, because the mean of its divisors is an integer number (16720704756).
Almost surely, 2100323131313 is an apocalyptic number.
It is an amenable number.
100323131313 is a deficient number, since it is larger than the sum of its proper divisors (33442506735).
100323131313 is a wasteful number, since it uses less digits than its factorization.
100323131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365743.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 100323131313 its reverse (313131323001), we get a palindrome (413454454314).
The spelling of 100323131313 in words is "one hundred billion, three hundred twenty-three million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •