Base | Representation |
---|---|
bin | 101110100111110100… |
… | …0110000010000110001 |
3 | 100120102120001210210000 |
4 | 1131033220300100301 |
5 | 3120021301100223 |
6 | 113554502100213 |
7 | 10143034526442 |
oct | 1351750602061 |
9 | 316376053700 |
10 | 100120331313 |
11 | 39508353872 |
12 | 174a211a669 |
13 | 95977213c2 |
14 | 4bbb0252c9 |
15 | 290eaa8543 |
hex | 174fa30431 |
100120331313 has 10 divisors (see below), whose sum is σ = 149562470354. Its totient is φ = 66746887488.
The previous prime is 100120331291. The next prime is 100120331359. The reversal of 100120331313 is 313133021001.
It is a happy number.
100120331313 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 20 + 331 + 313 = 666.
It can be written as a sum of positive squares in only one way, i.e., 78182870544 + 21937460769 = 279612^2 + 148113^2 .
It is not a de Polignac number, because 100120331313 - 214 = 100120314929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100120331513) 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 9 ways as a sum of consecutive naturals, for example, 618026656 + ... + 618026817.
Almost surely, 2100120331313 is an apocalyptic number.
It is an amenable number.
100120331313 is a deficient number, since it is larger than the sum of its proper divisors (49442139041).
100120331313 is an equidigital number, since it uses as much as digits as its factorization.
100120331313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236053485 (or 1236053476 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 100120331313 its reverse (313133021001), we get a palindrome (413253352314).
The spelling of 100120331313 in words is "one hundred billion, one hundred twenty million, three hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •