Base | Representation |
---|---|
bin | 101110101101101001… |
… | …1010000110001010101 |
3 | 100120221012022000112100 |
4 | 1131123103100301111 |
5 | 3120421400231033 |
6 | 114030132312313 |
7 | 10150632063651 |
oct | 1353323206125 |
9 | 316835260470 |
10 | 100316023893 |
11 | 395a8864578 |
12 | 17537772699 |
13 | 95c912ac27 |
14 | 4bd9005a61 |
15 | 2921d61513 |
hex | 175b4d0c55 |
100316023893 has 12 divisors (see below), whose sum is σ = 148817165068. Its totient is φ = 65069853120.
The previous prime is 100316023867. The next prime is 100316023897. The reversal of 100316023893 is 398320613001.
100316023893 is a `hidden beast` number, since 10 + 0 + 3 + 1 + 602 + 38 + 9 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 95952496644 + 4363527249 = 309762^2 + 66057^2 .
It is not a de Polignac number, because 100316023893 - 216 = 100315958357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100316023897) 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 11 ways as a sum of consecutive naturals, for example, 150624328 + ... + 150624993.
Almost surely, 2100316023893 is an apocalyptic number.
It is an amenable number.
100316023893 is a deficient number, since it is larger than the sum of its proper divisors (48501141175).
100316023893 is a wasteful number, since it uses less digits than its factorization.
100316023893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301249364 (or 301249361 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 36.
Adding to 100316023893 its reverse (398320613001), we get a palindrome (498636636894).
The spelling of 100316023893 in words is "one hundred billion, three hundred sixteen million, twenty-three thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •